SCHEDULING TO MINIMIZE MAKESPAN ON UNEQUAL PARALLEL PROCESSORS
- 1 October 1980
- journal article
- Published by Wiley in Decision Sciences
- Vol. 11 (4) , 586-602
- https://doi.org/10.1111/j.1540-5915.1980.tb01163.x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical ProcessorsJournal of the ACM, 1977
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969