Title: Approximative procedures for no-wait job shop scheduling
Abstract: 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.
Publication Year: 2003
Publication Date: 2003-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 132
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot