Lower bounds for on-line single-machine scheduling

Leah Epstein; Rob Van Stee

doi:10.1016/S0304-3975(02)00488-7

Lower bounds for on-line single-machine scheduling

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

Abstract

The problem of scheduling jobs that arrive over time on a single machine is well studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.

Original language	English
Pages (from-to)	439-450
Number of pages	12
Journal	Theoretical Computer Science
Volume	299
Issue number	1-3
DOIs	https://doi.org/10.1016/S0304-3975(02)00488-7
State	Published - 18 Apr 2003
Externally published	Yes

Bibliographical note

Funding Information:
A preliminary version of this paper appeared in Proc. 26th Mathematical Foundations of Computer Science, 2001, pp. 338–350. ∗Corresponding author. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1This work done while the author was at the CWI, The Netherlands. Research supported by the Netherlands Organization for Scienti6c Research (NWO), project number SION 612-30-002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/S0304-3975(02)00488-7

Cite this

@article{44203e51bde1462191c2050152a7dc06,

title = "Lower bounds for on-line single-machine scheduling",

abstract = "The problem of scheduling jobs that arrive over time on a single machine is well studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.",

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

note = "Funding Information: A preliminary version of this paper appeared in Proc. 26th Mathematical Foundations of Computer Science, 2001, pp. 338–350. ∗Corresponding author. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1This work done while the author was at the CWI, The Netherlands. Research supported by the Netherlands Organization for Scienti6c Research (NWO), project number SION 612-30-002.",

year = "2003",

month = apr,

day = "18",

doi = "10.1016/S0304-3975(02)00488-7",

language = "English",

volume = "299",

pages = "439--450",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Lower bounds for on-line single-machine scheduling

AU - Epstein, Leah

AU - Van Stee, Rob

N1 - Funding Information: A preliminary version of this paper appeared in Proc. 26th Mathematical Foundations of Computer Science, 2001, pp. 338–350. ∗Corresponding author. E-mail addresses: [email protected] (L. Epstein), [email protected] (R. van Stee). 1This work done while the author was at the CWI, The Netherlands. Research supported by the Netherlands Organization for Scienti6c Research (NWO), project number SION 612-30-002.

PY - 2003/4/18

Y1 - 2003/4/18

N2 - The problem of scheduling jobs that arrive over time on a single machine is well studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.

AB - The problem of scheduling jobs that arrive over time on a single machine is well studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.

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

U2 - 10.1016/S0304-3975(02)00488-7

DO - 10.1016/S0304-3975(02)00488-7

M3 - Article

AN - SCOPUS:0037453325

SN - 0304-3975

VL - 299

SP - 439

EP - 450

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

Lower bounds for on-line single-machine scheduling

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this