Sciweavers

Share
ESA
1999
Springer

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

10 years 6 days ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the lp norm of the vector of completion times. This generalizes and simplifies many previous results in this area.
Leah Epstein, Jiri Sgall
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ESA
Authors Leah Epstein, Jiri Sgall
Comments (0)
books