A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
| Year of publication: |
2015
|
|---|---|
| Authors: | Wan, Long ; Yuan, Jinjiang ; Geng, Zhichao |
| 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. 315-323
|
| Subject: | Preemptive scheduling | Release time | Deadline | NP-hard | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Terminplanung | Time scheduling | Zeit | Time | Heuristik | Heuristics |
-
Choi, Seong-Woo, (2017)
-
Scheduling on-site service deliveries to minimise the risk of missing appointment times
Ji, Chenlu, (2022)
-
Pappis, Costas P., (2010)
- More ...
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
-
Pareto-scheduling of two competing agents with their own equal processing times
Chen, Rubing, (2022)
-
Single-machine scheduling of multiple projects with controllable processing times
Geng, Zhichao, (2023)
- More ...