|
|||||
|
|
Approximative procedures for no-wait job shop scheduling |
|
| Authors: | Christoph J Schuster Jose M Framinan |
| Affiliation: | a Institute of Mathematics, University of Duisburg, 47048 Duisburg, Germany b Industrial Management Research Group, School of Engineering, University of Seville, Seville, Spain |
| 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. |
| Keywords: | Scheduling Job shop No-wait Decomposition Local search Flow shop |
| 本文献已被 ScienceDirect 等数据库收录！ | |