Accelerating the calculation of makespan used in scheduling improvement heuristics
Golshan Madraki, Robert. P. Judd
| Year of publication: |
2021
|
|---|---|
| Authors: | Madraki, Golshan ; Judd, Robert. P. |
| 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. 130.2021, p. 1-19
|
| Subject: | Algorithm | Graph theory | Makespan | Scheduling problem | The longest path | Scheduling-Verfahren | Heuristik | Heuristics | Algorithmus | Graphentheorie | Durchlaufzeit | Lead time |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2021.105233 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012506531