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.
|Title of host publication||Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings|
|Number of pages||12|
|ISBN (Print)||3540662510, 9783540662518|
|State||Published - 1999|
|Event||7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic|
Duration: 16 Jul 1999 → 18 Jul 1999
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||7th Annual European Symposium on Algorithms, ESA 1999|
|Period||16/07/99 → 18/07/99|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)