Fast heuristics for minimizing the makespan in non-permutation flow shops
Alexander J. Benavides, Marcus Ritt
| Year of publication: |
December 2018
|
|---|---|
| Authors: | Benavides, Alexander J. ; Ritt, Marcus |
| 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. 100.2018, p. 230-243
|
| Subject: | Scheduling | Metaheuristics | Flow shop | Non-permutation schedules | Makespan | Iterated greedy algorithm | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2018.07.017 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011930607