Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- 1 November 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (4) , 1119-1129
- https://doi.org/10.1137/0215081
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Worst-Case Analysis of a Placement Algorithm Related to Storage AllocationSIAM Journal on Computing, 1975
- Bounds for the Optimal Scheduling of n Jobs on m ProcessorsManagement Science, 1964
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956