How small are shifts required in optimal preemptive schedules?
E. G. Coffman Jr.; C. T. Ng; V. G. Timkovsky
| Year of publication: |
2015
|
|---|---|
| Authors: | Coffman, Edward G. ; Ng, C. T. ; Timkovsky, V. G. |
| Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 2, p. 155-163
|
| Subject: | Preemptive scheduling | Identical parallel machines | Release dates | Due dates | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
| 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/10010504100