| Article ID: | iaor19911709 |
| Country: | United Kingdom |
| Volume: | 19 |
| Start Page Number: | 64 |
| End Page Number: | 67 |
| Publication Date: | Dec 1991 |
| Journal: | OMEGA |
| Authors: | Ogbu F.A., Smith D.K. |
| Keywords: | heuristics, scheduling, optimization: simulated annealing |
This paper considers two recently published simulated annealing approaches to flowshop problems, and comments on the algorithms and the similarity of their results and conclusions. It finds that the simulated annealing heuristic provides optimal or near-optimal solutions to the permutation flowshop problem, and encourages their use by practitioners.