Article ID: | iaor20071172 |
Country: | Singapore |
Volume: | 21 |
Issue: | 1 |
Start Page Number: | 97 |
End Page Number: | 115 |
Publication Date: | Jan 2004 |
Journal: | Asia-Pacific Journal of Operational Research |
Authors: | Ong H.L., Liu S.Q. |
Keywords: | heuristics |
In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence's benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.