A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
Year of publication: |
2012
|
---|---|
Authors: | Zhu, Jie ; Li, Xiaoping ; Shen, Weiming |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 50.2012, 10 (15.5.), p. 2692-2704
|
Subject: | job shop | no-wait | scheduling | two-machine | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Produktionssteuerung | Production control | Theorie | Theory | Fließfertigung | Assembly-line production |
-
Multi-degree cyclic flow shop robotic cell scheduling problem : ant colony optimization
Elmi, Atabak, (2016)
-
The optimal number of used machines in a two-stage flexible flowshop scheduling problem
Gerstl, Enrique, (2014)
-
Yang, Shengluo, (2021)
- More ...
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
Zhu, Jie, (2012)
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
- More ...