A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Year of publication: |
2013
|
---|---|
Authors: | Gerstl, Enrique ; Mosheiov, Gur |
Published in: |
International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 146.2013, 1, p. 161-166
|
Publisher: |
Elsevier |
Subject: | Scheduling | Flowshop | Makespan | Dynamic programming | Heuristic | Not-All-Machines |
-
A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Gerstl, Enrique, (2013)
-
A new improved NEH heuristic for permutation flowshop scheduling problems
Liu, Weibo, (2017)
-
Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
Jafari-Nodoushan, Abbasali, (2021)
- More ...
-
Scheduling job classes on uniform machines
Gerstl, Enrique, (2012)
-
Scheduling with a due-window for acceptable lead-times
Gerstl, Enrique, (2015)
-
Due-window assignment with identical jobs on parallel uniform machines
Gerstl, Enrique, (2013)
- More ...