Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477209 | European Journal of Operational Research | 2009 | 9 Pages |
Abstract
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 method, CLLM (complete local search with limited memory), is presented by integrating with shift timetabling for the sequencing component. Experimental results show that CLLM outperforms all the existing effective algorithms for the considered problem with a little more computation time.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jie Zhu, Xiaoping Li, Qian Wang,