摘要：AbstractThis work presents an algorithm to automatically translate a Blocking Flexible Job Shop Scheduling Problem modeling into automata using the Supervisory Control Theory. Different problems of the literature are analyzed in their textual form and the algorithm returns an automaton that implements the closed-loop behavior under the Supervisory Control Theory. A heuristic is applied to find, among all sequences, the sequence that minimizes the makespan. With our approach, we find makespan values near to those in the literature. This methodology faces memory usage boundaries, but it was able to find solutions for instances of some well-known problems.
关键词：KeywordsSupervisory Control TheoryOptimizationJob Shop SchedulingBlockingApplication
