An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
Authors:
- Chandra ChekuriCCChandra Chekuri
- Michael BenderMBMichael Bender
- 30 November 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (2) , 212-224
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related MachinesJournal of Algorithms, 2001
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different SpeedsJournal of Algorithms, 1999
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Efficient scheduling of tasks without full use of processor resourcesTheoretical Computer Science, 1980
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966