An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Year of publication: |
May 2017
|
---|---|
Authors: | Dubois-Lacoste, Jérémie ; Pagnozzi, Federico ; Stützle, Thomas G. |
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. 81.2017, p. 160-166
|
Subject: | Combinatorial optimization | Heuristic algorithms | Iterated greedy | Scheduling | Permutation flowshop problem | Makespan | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Pagnozzi, Federico, (2021)
-
Ozturk, Onur, (2017)
-
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Ćwik, Michał, (2018)
- More ...
-
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, Manuel, (2016)
-
Dubois-Lacoste, Jérémie, (2015)
-
The irace package : iterated racing for automatic algorithm configuration
López-Ibáñez, Manuel, (2016)
- More ...