Minimizing Schedule Length Subject to Minimum Flow Time
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2), 314-326
- https://doi.org/10.1137/0218022
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Bin packing with divisible item sizesJournal of Complexity, 1987
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- On Scheduling Independent Tasks with Restricted Execution TimesOperations Research, 1982
- Preemptive Scheduling with Due DatesOperations Research, 1979
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Algorithms minimizing mean flow time: schedule-length propertiesActa Informatica, 1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959