Algorithms minimizing mean flow time: schedule-length properties
- 1 March 1976
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 6 (1), 1-14
- https://doi.org/10.1007/bf00263740
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972