Normal-form preemption sequences for an open problem in scheduling theory
Year of publication: |
December 2016
|
---|---|
Authors: | Chen, Bo ; Coffman, Edward G. ; Dereniowski, Dariusz ; Kubiak, Wieslaw |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 6, p. 701-728
|
Subject: | Preemption | Parallel machines | In-tree | Release date | Scheduling algorithm | Total completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics | Produktionssteuerung | Production control |
-
Bi-criteria scheduling with machine assignment costs
Leung, Joseph Y.-T., (2012)
-
Parameterized complexity of machine scheduling : 15 open problems
Mnich, Matthias, (2018)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
- More ...
-
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
Dereniowski, Dariusz, (2010)
-
Routing equal-size messages on a slotted ring
Dereniowski, Dariusz, (2012)
-
Dereniowski, Dariusz, (2018)
- More ...