METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
- 1 March 2004
- journal article
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 21 (1), 97-115
- https://doi.org/10.1142/s0217595904000072
Abstract
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 a 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.Keywords
This publication has 15 references indexed in Scilit:
- Complexity of mixed shop scheduling problems: A surveyEuropean Journal of Operational Research, 2000
- A tabu search algorithm for the open shop scheduling problemComputers & Operations Research, 1999
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Two-Machine Super-Shop Scheduling ProblemJournal of the Operational Research Society, 1991
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealingJournal of Computational Physics, 1990
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- The mixed shop scheduling problemDiscrete Applied Mathematics, 1985
- Optimization by Simulated AnnealingScience, 1983
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954