A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- 1 June 2007
- journal article
- conference paper
- Published by Elsevier in Theoretical Computer Science
- Vol. 380 (1-2) , 87-99
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Computing Nash equilibria for scheduling on restricted parallel links2004
- Fast and simple approximation schemes for generalized flowMathematical Programming, 2002
- Improved Approximation Schemes for Scheduling Unrelated Parallel MachinesMathematics of Operations Research, 2001
- On the Single-Source Unsplittable Flow ProblemCombinatorica, 1999
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation ProblemMathematics of Operations Research, 1997
- Combinatorial Algorithms for the Generalized Circulation ProblemMathematics of Operations Research, 1991
- Fast algorithms for convex quadratic programming and multicommodity flows1986
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966
- New Methods in Mathematical Programming—Optimal Flow Through Networks with GainsOperations Research, 1962