Zhu, Jie; Li, Xiaoping; Wang, Qian - In: European Journal of Operational Research 198 (2009) 2, pp. 378-386
In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective...