Minimizing the maximum starting time on-line

Leah Epstein; Rob Van Stee

doi:10.1007/3-540-45749-6_41

Minimizing the maximum starting time on-line

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

Abstract

We study the schedulingproblem of minimizing the maximum startingtime on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of Ө(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m — 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m — 2 machines.

Original language	English
Title of host publication	Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
Editors	Rolf Möhring, Rajeev Raman
Publisher	Springer Verlag
Pages	449-460
Number of pages	12
ISBN (Electronic)	3540441808, 9783540441809
DOIs	https://doi.org/10.1007/3-540-45749-6_41
State	Published - 2002
Externally published	Yes
Event	10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy Duration: 17 Sep 2002 → 21 Sep 2002

Publication series

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

Conference

Conference	10th Annual European Symposium on Algorithms, ESA 2002
Country/Territory	Italy
City	Rome
Period	17/09/02 → 21/09/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45749-6_41

Cite this

Epstein, L., & Van Stee, R. (2002). Minimizing the maximum starting time on-line. In R. Möhring, & R. Raman (Eds.), Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings (pp. 449-460). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_41

@inproceedings{33b4c7a7d59e472cb808f38c44eb8bc3,

title = "Minimizing the maximum starting time on-line",

abstract = "We study the schedulingproblem of minimizing the maximum startingtime on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of Ө(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m — 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m — 2 machines.",

author = "Leah Epstein and {Van Stee}, Rob",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 10th Annual European Symposium on Algorithms, ESA 2002 ; Conference date: 17-09-2002 Through 21-09-2002",

year = "2002",

doi = "10.1007/3-540-45749-6_41",

language = "English",

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

publisher = "Springer Verlag",

pages = "449--460",

editor = "Rolf M{\"o}hring and Rajeev Raman",

booktitle = "Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings",

address = "Germany",

}

Epstein, L & Van Stee, R 2002, Minimizing the maximum starting time on-line. in R Möhring & R Raman (eds), Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, Springer Verlag, pp. 449-460, 10th Annual European Symposium on Algorithms, ESA 2002, Rome, Italy, 17/09/02. https://doi.org/10.1007/3-540-45749-6_41

Minimizing the maximum starting time on-line. / Epstein, Leah; Van Stee, Rob.
Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. ed. / Rolf Möhring; Rajeev Raman. Springer Verlag, 2002. p. 449-460 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461).

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

TY - GEN

T1 - Minimizing the maximum starting time on-line

AU - Epstein, Leah

AU - Van Stee, Rob

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

PY - 2002

Y1 - 2002

N2 - We study the schedulingproblem of minimizing the maximum startingtime on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of Ө(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m — 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m — 2 machines.

AB - We study the schedulingproblem of minimizing the maximum startingtime on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of Ө(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m — 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m — 2 machines.

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

U2 - 10.1007/3-540-45749-6_41

DO - 10.1007/3-540-45749-6_41

M3 - Conference contribution

AN - SCOPUS:84938092754

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

SP - 449

EP - 460

BT - Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings

A2 - Möhring, Rolf

A2 - Raman, Rajeev

PB - Springer Verlag

T2 - 10th Annual European Symposium on Algorithms, ESA 2002

Y2 - 17 September 2002 through 21 September 2002

ER -

Epstein L, Van Stee R. Minimizing the maximum starting time on-line. In Möhring R, Raman R, editors, Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Springer Verlag. 2002. p. 449-460. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45749-6_41

Minimizing the maximum starting time on-line

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this