Normal-form preemption sequences for an open problem in scheduling theory
Year of publication: |
December 2016
|
---|---|
Authors: | Chen, Bo ; Coffman, Ed ; 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 | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Two parallel identical machines scheduling to minimise the maximum inter-completion time
Zheng, Feifeng, (2020)
-
Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi, (2024)
-
Huo, Yumei, (2019)
- More ...
-
Routing equal-size messages on a slotted ring
Dereniowski, Dariusz, (2012)
-
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
Dereniowski, Dariusz, (2010)
-
Shared processor scheduling of multiprocessor jobs
Dereniowski, Dariusz, (2020)
- More ...