Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Year of publication: |
2009
|
---|---|
Authors: | Zhu, Jie ; Li, Xiaoping ; Wang, Qian |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 198.2009, 2 (16.10.), p. 378-386
|
Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time | Suchtheorie | Search theory | Tourenplanung | Vehicle routing problem |
-
Nsakanda, Aaron Luntala, (2011)
-
Minimizing the total completion time of an urban delivery problem with uncertain assembly time
Liu, Bingbing, (2019)
-
Improved local search approaches to solve the post enrolment course timetabling problem
Say Leng Goh, (2017)
- More ...
-
Zhu, Jie, (2012)
-
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
Wang, Chuyang, (2010)
-
Zhang, Yi, (2009)
- More ...