| Article ID: | iaor20032803 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 4 |
| Start Page Number: | 308 |
| End Page Number: | 318 |
| Publication Date: | Jul 2003 |
| Journal: | Operations Research Letters |
| Authors: | Framinan Jose M., Schuster Christoph J. |
| Keywords: | local search, job shop |
In this article we consider the no-wait job shop problem with makespan objective. Based on a decomposition of the problem into a sequencing and a timetabling problem, we propose two local search algorithms. Extensive computational tests in which the algorithms compare favorably to the best existing strategies are reported. Although not specifically designed for that purpose, our algorithms also outperform one of the best no-wait flow shop algorithms in literature.