Approximation schemes for scheduling on uniformly related and identical parallel machines

Leah Epstein, Jiří Sgall

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAlgorithms - ESA 1999 - 7th Annual European Symposium, Proceedings
EditorsJaroslav Nešetřil
PublisherSpringer Verlag
Pages151-162
Number of pages12
ISBN (Print)3540662510, 9783540662518
DOIs
StatePublished - 1999
Externally publishedYes
Event7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic
Duration: 16 Jul 199918 Jul 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1643
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th Annual European Symposium on Algorithms, ESA 1999
Country/TerritoryCzech Republic
CityPrague
Period16/07/9918/07/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Approximation schemes for scheduling on uniformly related and identical parallel machines'. Together they form a unique fingerprint.

Cite this