| Article ID: | iaor20171561 |
| Volume: | 24 |
| Issue: | 5 |
| Start Page Number: | 1119 |
| End Page Number: | 1137 |
| Publication Date: | Sep 2017 |
| Journal: | International Transactions in Operational Research |
| Authors: | Cruz-Chvez Marco Antonio, Martnez-Rangel Martn G, Cruz-Rosales Martn H |
| Keywords: | scheduling, combinatorial optimization, optimization: simulated annealing, heuristics |
This paper presents a simulated annealing algorithm accelerated by a partial scheduling mechanism and a cooling schedule mechanism that is a function of the standard deviation. This facilitates a rapid approach to good solutions in the flexible job shop scheduling problem (FJSSP). The results demonstrate that for benchmark instances of several sizes, simulated annealing that implements the proposed mechanism converges more quickly to good solutions than simulated annealing that does not implement the proposed mechanism.