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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Epstein\thanks{School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. lea@idc.ac.il., L., Sgall, J. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Algorithmica 39, 43–57 (2004). https://doi.org/10.1007/s00453-003-1077-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1077-7