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 | Algorithmus | Algorithm |
-
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Lin, Shih Wei, (2013)
-
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J., (2018)
-
Öztop, Hande, (2022)
- More ...
-
Prata, Bruno de Athayde, (2022)
-
Assembly flowshop scheduling problem : speed-up procedure and computational evaluation
Fernandez-Viagas, Victor, (2022)
-
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Fernandez-Viagas, Victor, (2020)
- More ...