Efficient algorithm to find makespan in manufacturing systems under multiple scheduling perturbations
Golshan Madraki and Robert P. Judd
| Year of publication: |
1-15 August 2018
|
|---|---|
| Authors: | Madraki, Golshan ; Judd, Robert P. |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 56.2018, 16 (1/15.8.), p. 5402-5418
|
| Subject: | algorithm | Directed Acyclic Graph | the longest path | buffered job shop system | makespan | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Graphentheorie | Graph theory | Produktionssystem | Manufacturing system |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1080/00207543.2017.1407884 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011931200