Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
Year of publication: |
2021
|
---|---|
Authors: | Wang, Tianyu ; Bellenguez, Odile |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 6, p. 649-662
|
Subject: | Preemptive scheduling | In-tree | Level-orders | Precedence constraints | Complexity theory | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Normal-form preemption sequences for an open problem in scheduling theory
Chen, Bo, (2016)
-
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Epstein, Leah, (2014)
-
Epstein, Leah, (2017)
- More ...
-
Larroche, François, (2022)
-
Wang, Tianyu, (2024)
-
Wang, Tianyu, (2023)
- More ...