Approximation schemes for scheduling on uniformly related and identical parallel machines

Leah Epstein; Jiří Sgall

doi:10.1007/3-540-48481-7_14

Approximation schemes for scheduling on uniformly related and identical parallel machines

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings
Editors	Jaroslav Nešetřil
Publisher	Springer Verlag
Pages	151-162
Number of pages	12
ISBN (Print)	3540662510, 9783540662518
DOIs	https://doi.org/10.1007/3-540-48481-7_14
State	Published - 1999
Externally published	Yes
Event	7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic Duration: 16 Jul 1999 → 18 Jul 1999

Publication series

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

Conference

Conference	7th Annual European Symposium on Algorithms, ESA 1999
Country/Territory	Czech Republic
City	Prague
Period	16/07/99 → 18/07/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-48481-7_14

Cite this

Epstein, L., & Sgall, J. (1999). Approximation schemes for scheduling on uniformly related and identical parallel machines. In J. Nešetřil (Ed.), Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings (pp. 151-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643). Springer Verlag. https://doi.org/10.1007/3-540-48481-7_14

Epstein, Leah ; Sgall, Jiří. / Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. editor / Jaroslav Nešetřil. Springer Verlag, 1999. pp. 151-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e3c6fe5dbea840d48026204a5aa5341a,

title = "Approximation schemes for scheduling on uniformly related and identical parallel machines",

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.",

author = "Leah Epstein and Ji{\v r}{\'i} Sgall",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th Annual European Symposium on Algorithms, ESA 1999 ; Conference date: 16-07-1999 Through 18-07-1999",

year = "1999",

doi = "10.1007/3-540-48481-7_14",

language = "English",

isbn = "3540662510",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "151--162",

editor = "Jaroslav Ne{\v s}et{\v r}il",

booktitle = "Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings",

address = "Germany",

}

Epstein, L & Sgall, J 1999, Approximation schemes for scheduling on uniformly related and identical parallel machines. in J Nešetřil (ed.), Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1643, Springer Verlag, pp. 151-162, 7th Annual European Symposium on Algorithms, ESA 1999, Prague, Czech Republic, 16/07/99. https://doi.org/10.1007/3-540-48481-7_14

Approximation schemes for scheduling on uniformly related and identical parallel machines. / Epstein, Leah; Sgall, Jiří.
Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. ed. / Jaroslav Nešetřil. Springer Verlag, 1999. p. 151-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximation schemes for scheduling on uniformly related and identical parallel machines

AU - Epstein, Leah

AU - Sgall, Jiří

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938065515&partnerID=8YFLogxK

U2 - 10.1007/3-540-48481-7_14

DO - 10.1007/3-540-48481-7_14

M3 - Conference contribution

AN - SCOPUS:84938065515

SN - 3540662510

SN - 9783540662518

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 151

EP - 162

BT - Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings

A2 - Nešetřil, Jaroslav

PB - Springer Verlag

T2 - 7th Annual European Symposium on Algorithms, ESA 1999

Y2 - 16 July 1999 through 18 July 1999

ER -

Epstein L, Sgall J. Approximation schemes for scheduling on uniformly related and identical parallel machines. In Nešetřil J, editor, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Springer Verlag. 1999. p. 151-162. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48481-7_14

Approximation schemes for scheduling on uniformly related and identical parallel machines

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this