| Article ID: | iaor20023228 |
| Country: | United Kingdom |
| Volume: | 29 |
| Issue: | 6 |
| Start Page Number: | 599 |
| End Page Number: | 608 |
| Publication Date: | Dec 2001 |
| Journal: | OMEGA |
| Authors: | Schmidt Gnter, Baewicz Jacek, Kubiak Wiesaw, Formanowicz Piotr, Breit Joachim |
| Keywords: | flowshop |
The paper studies a flowshop scheduling problem where machines are not available in given time intervals. The objective is to minimize the makespan. The problem is known to be NP-hard for two machines. We analyze constructive and local search based heuristic algorithms for the two-machine case. The algorithms are tested on easy and difficult test problems with up to 100 jobs and 10 intervals of non-availability. Computational results show that the algorithms perform well. For many problems an optimum solution is found.