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 | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Algorithmus | Algorithm |
-
Mixed batch scheduling on identical machines
Wang, Jun-Qiang, (2020)
-
Scheduling two identical parallel machines with preparation constraints
Labbi, Wafaa, (2017)
-
Solving parallel machines job-shop scheduling problems by an adaptive algorithm
Gholami, Omid, (2014)
- More ...
-
Online algorithms for multilevel aggregation
Bienkowski, Marcin, (2020)
-
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Baptiste, Philippe, (2004)
-
Complexity of a one-to-one meeting scheduling problem with two types of actors
Le Roux, Agnès, (2015)
- More ...