Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility
Simon Thevenin, Nicolas Zufferey and Jean-Yves Potvin
| Year of publication: |
1-15 March 2017
|
|---|---|
| Authors: | Thevenin, Simon ; Zufferey, Nicolas ; Potvin, Jean-Yves |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 55.2017, 5/6 (1/15.3.), p. 1588-1606
|
| Subject: | graph theory | scheduling | makespan | metaheuristics | tabu search | evolutionary algorithms | combinatorial optimisation | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Graphentheorie | Graph theory | Evolutionärer Algorithmus | Evolutionary algorithm | Branch-and-Bound | Branch and Bound |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1080/00207543.2016.1181285 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011628297