A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
Year of publication: |
2019
|
---|---|
Authors: | Wang, Tianyu ; Bellenguez-Morineau, Odile |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 6, p. 709-714
|
Subject: | Parallel scheduling | In-tree | Precedence constraints | Complexity theory | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Wang, Tianyu, (2021)
-
Malleable scheduling for flows of jobs and applications to MapReduce
Nagarajan, Viswanath, (2019)
-
Normal-form preemption sequences for an open problem in scheduling theory
Chen, Bo, (2016)
- More ...
-
Wang, Tianyu, (2019)
-
A constraint-based approach for the shift design personnel task scheduling problem with equity
Lapègue, Tanguy, (2013)
-
Prot, Damien, (2013)
- More ...