Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
Year of publication: |
January 2017
|
---|---|
Authors: | Tasgetiren, M. Fatih ; Kizilay, Damla ; Pan, Quan Ke ; Suganthan, P. N. |
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. 77.2017, p. 111-126
|
Subject: | Meta-heuristics | Blocking flowshop | Iterated greedy algorithm | Variable neighborhood search | Constructive heuristics | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Öztop, Hande, (2022)
-
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J., (2018)
-
Metaheuristic algorithms for the hybrid flowshop scheduling problem
Öztop, Hande, (2019)
- More ...
-
Gao, Kai Zhou, (2015)
-
Öztop, Hande, (2022)
-
Metaheuristic algorithms for the hybrid flowshop scheduling problem
Öztop, Hande, (2019)
- More ...