Non-clairvoyant scheduling for weighted flow time
References (12)
Scheduling in the dark
Theoret. Comput. Sci.
(2000)- et al.
Minimizing weighted response time
- et al.
Non-clairvoyant scheduling for mean slowdown
- et al.
Scheduling to minimize average stretch without migration
- et al.
Approximation schemes for preemptive weighted flow time
- et al.
Algorithms for weighted flow time
There are more references available in the full text version of this article.
Cited by (16)
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
2023, Proceedings of Machine Learning ResearchMinimalistic Predictions to Schedule Jobs with Online Precedence Constraints
2023, Proceedings of Machine Learning ResearchCompetitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling
2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 2003 Published by Elsevier B.V.