A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
Year of publication: |
2015
|
---|---|
Authors: | Fernandez-Viagas, Victor ; Framinan, Jose M. |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 53.2015, 4 (15.2.), p. 1111-1123
|
Subject: | distributed permutation flowshop | scheduling | heuristics | iterated greedy algorithm | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Durchlaufzeit | Lead time |
-
Distributed permutation flowshop scheduling problem with total completion time objective
Ali, Arshad, (2021)
-
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Lin, Shih Wei, (2013)
-
Öztop, Hande, (2022)
- More ...
-
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Fernandez-Viagas, Victor, (2015)
-
Fernandez-Viagas, Victor, (2014)
-
Fernandez-Viagas, Victor, (2016)
- More ...