Metaheuristic algorithms for the hybrid flowshop scheduling problem
Year of publication: |
2019
|
---|---|
Authors: | Öztop, Hande ; Tasgetiren, M. Fatih ; Eliiyi, Deniz Türsel ; Pan, Quan Ke |
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. 111.2019, p. 177-196
|
Subject: | Hybrid flowshop scheduling | Block insertion heuristic | Iterated greedy algorithm | Makespan | Total flow time | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Heuristik | Heuristics | Durchlaufzeit | Lead time | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm |
-
He, Xuan, (2024)
-
Öztop, Hande, (2022)
-
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J., (2018)
- More ...
-
Öztop, Hande, (2022)
-
Modeling and optimization of multiple traveling salesmen problems : an evolution strategy approach
Karabulut, Korhan, (2021)
-
Karabulut, Korhan, (2022)
- More ...