A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Year of publication: |
2019
|
---|---|
Authors: | Fernandez-Viagas, Victor ; Framinan, Jose M. |
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. 112.2019, p. 1-12
|
Subject: | Scheduling | Flowshop | Heuristics | Flow shop | Tie-breaking | NEH | Iterated greedy | Scheduling-Verfahren | Scheduling problem | Heuristik | Durchlaufzeit | Lead time | Evolutionärer Algorithmus | Evolutionary algorithm |
-
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Fernandez-Viagas, Victor, (2015)
-
Fernandez-Viagas, Victor, (2014)
-
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Fernandez-Viages, Victor, (2014)
- 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 ...