Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
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.
Year of publication: |
2009
|
---|---|
Authors: | Zhu, Jie ; Li, Xiaoping ; Wang, Qian |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 198.2009, 2, p. 378-386
|
Publisher: |
Elsevier |
Subject: | No-wait Job shop Timetabling Sequencing |
Saved in:
Saved in favorites
Similar items by person
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
Zhu, Jie, (2012)
- More ...