Minimizing the maximum starting time on-line

Leah Epstein; Rob Van Stee

doi:10.1016/j.ic.2004.09.001

Minimizing the maximum starting time on-line

Research output: Contribution to journal › Article › peer-review

Abstract

We study the scheduling problem of minimizing the maximum starting time 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
Pages (from-to)	53-65
Number of pages	13
Journal	Information and Computation
Volume	195
Issue number	1-2
DOIs	https://doi.org/10.1016/j.ic.2004.09.001
State	Published - 15 Dec 2004
Externally published	Yes

Bibliographical note

Funding Information:
A preliminary version of this paper appeared in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), p. 449–460. ∗ Corresponding author. Fax: +31 20 592 4199. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1 This research was supported by Israel Science Foundation (Grant No. 250/01). 2 This research was supported by the Netherlands Organization for Scientific Research (NWO), Project No. SION 612-061-000.

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1016/j.ic.2004.09.001

Cite this

@article{824fff179f1f49ae98ed8a18f13260ea,

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

abstract = "We study the scheduling problem of minimizing the maximum starting time 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 = "Funding Information: A preliminary version of this paper appeared in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), p. 449–460. ∗ Corresponding author. Fax: +31 20 592 4199. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1 This research was supported by Israel Science Foundation (Grant No. 250/01). 2 This research was supported by the Netherlands Organization for Scientific Research (NWO), Project No. SION 612-061-000.",

year = "2004",

month = dec,

day = "15",

doi = "10.1016/j.ic.2004.09.001",

language = "English",

volume = "195",

pages = "53--65",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Minimizing the maximum starting time on-line

AU - Epstein, Leah

AU - Van Stee, Rob

N1 - Funding Information: A preliminary version of this paper appeared in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), p. 449–460. ∗ Corresponding author. Fax: +31 20 592 4199. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1 This research was supported by Israel Science Foundation (Grant No. 250/01). 2 This research was supported by the Netherlands Organization for Scientific Research (NWO), Project No. SION 612-061-000.

PY - 2004/12/15

Y1 - 2004/12/15

N2 - We study the scheduling problem of minimizing the maximum starting time 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 scheduling problem of minimizing the maximum starting time 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=10444257397&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2004.09.001

DO - 10.1016/j.ic.2004.09.001

M3 - Article

AN - SCOPUS:10444257397

SN - 0890-5401

VL - 195

SP - 53

EP - 65

JO - Information and Computation

JF - Information and Computation

IS - 1-2

ER -

Minimizing the maximum starting time on-line

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this