Tradução automática de problemas de escalonamento job shop flexível com bloqueio para autômatos utilizando a TCS

Abstract

This work presents an algorithm to automatically translate the search space of a Blocking Flexible Job Shop Scheduling Problem modeling into automata using the Supervisory Control Theory. Some problems of the literature are analyzed in their textual form and the algorithm returns an automaton that implements the closed-loop behavior. A heuristic that minimizes makespan is applied. This methodology faces memory usage boundaries, but it wasable to find makespan values near to those in the literature.