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.

• Type: Conference
• Year: 1999
• Where: ESA
• Authors: Leah Epstein, Jiri Sgall
• Keywords: Algorithms, Completion Times, ESA 1999, Machine Completion Times, Polynomial Approximation Scheme