Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- 1 February 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (2) , 155-164
- https://doi.org/10.1016/0166-218x(85)90009-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery TimesOperations Research, 1980
- Worst-Case Analysis of Heuristic AlgorithmsManagement Science, 1980
- Performance Guarantees for Scheduling AlgorithmsOperations Research, 1978
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977
- Finding the medianJournal of Computer and System Sciences, 1976
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973