Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Year of publication: |
2014
|
---|---|
Authors: | Jeong, BongJoo ; Kim, Yeong-dae |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 47.2014, p. 72-80
|
Subject: | Scheduling | Re-entrant flowshop | Sequence-dependent setup times | Branch and bound | Heuristics | Durchlaufzeit | Lead time | Heuristik | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Evolutionärer Algorithmus | Evolutionary algorithm | Fließfertigung | Assembly-line production |
-
Minimising maximum tardiness in assembly flowshops with setup times
Aydilek, Asiye, (2017)
-
Accelerated methods for total tardiness minimisation in no-wait flowshops
Ding, Jianya, (2015)
-
Detienne, Boris, (2016)
- More ...
-
Heuristics for determining a patrol path of an unmanned combat vehicle
Park, Chul-Hwan, (2012)
-
Algorithms for a two‐machine flowshop problem with jobs of two classes
Jeong, BongJoo, (2018)
-
Kim, Jae-Gon, (2020)
- More ...