A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
Year of publication: |
2015
|
---|---|
Authors: | Bellenguez-Morineau, Odile ; Chrobak, Marek ; Dürr, Christoph ; Prot, Damien |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 3, p. 299-304
|
Subject: | Scheduling | Complexity | Identical machines | Preemptive problems | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Prot, Damien, (2013)
-
Coordinated scheduling on parallel machines with batch delivery
Wan, Long, (2014)
-
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
Choi, Byung-Cheon, (2017)
- More ...
-
A constraint-based approach for the shift design personnel task scheduling problem with equity
Lapègue, Tanguy, (2013)
-
Prot, Damien, (2013)
-
A constraint-based approach for the shift design personnel task scheduling problem with equity
Lapègue, Tanguy, (2013)
- More ...