Heuristics for scheduling unrelated parallel machines
- 31 December 1991
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 18 (3), 323-331
- https://doi.org/10.1016/0305-0548(91)90034-o
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- Worst-case analysis of a scheduling algorithmOperations Research Letters, 1985
- Analysis of a linear programming heuristic for scheduling unrelated parallel machinesDiscrete Applied Mathematics, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- 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
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976