Scheduling unit-time jobs on processors with different capabilities
Authors:
- 31 December 1989
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 16 (5) , 409-417
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On a scheduling problem where a job can be executed only by a limited number of processorsComputers & Operations Research, 1988
- Fast Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1987
- Minimizing mean weighted execution time loss on identical and uniform processorsInformation Processing Letters, 1987
- Scheduling to minimize maximum lateness on unequal parallel processorsComputers & Operations Research, 1982
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975