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 l(p) norm of the vector of completion times. This generalizes and simplifies many previous results in this area.
scheduling parallel machines machine completion time approximation algorithms polynomial time approximation scheme