Ant colony optimization algorithm for reactive production scheduling problem in the job shop system

The response time for solution scheduling problem is a import criteria of consider in real manufacturing systems where large-scale scenarios must be evaluated since as unexpected events arise. This work describes a proposed modeling and analyses for the production reactive scheduling problem in a job shop system. The scheduling problem, generally, consists in allocate the production operations with the aim of minimizing the makespan. For that, it was employed an Ant Colony Optimization algorithm applied in a matrix of the feasible solution space problem representation. In the case of a reactive system, the approach should provide good solutions in a short execution time, allowing the analysis of large scenarios in hablle times. The results of this paper were compared with the results of other approaches in small and large scenarios.