Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Victor Fernandez-Viagas; Jose M. Framinan
| Year of publication: |
2014
|
|---|---|
| Authors: | Fernandez-Viagas, Victor ; Framinan, Jose M. |
| 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. 64.2015, p. 86-96
|
| Subject: | Scheduling | Flowshop | Heuristics | NEH | PFSP | Maximum tardiness | Makespan | Bounded insertion | Non-population algorithm | Scheduling-Verfahren | Scheduling problem | Heuristik | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm | Branch-and-Bound | Branch and Bound |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011373449