Approximation schemes for scheduling on uniformly related and identical parallel machines

Approximation schemes for scheduling on uniformly related and identical parallel machines

0.00 Avg rating—0 Votes
Article ID: iaor20053065
Country: Germany
Volume: 39
Issue: 1
Start Page Number: 43
End Page Number: 57
Publication Date: Jan 2004
Journal: Algorithmica
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.