Lower bounds for on-line single-machine scheduling

Leah Epstein, Rob Van Stee

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)439-450
Number of pages12
JournalTheoretical Computer Science
Volume299
Issue number1-3
DOIs
StatePublished - 18 Apr 2003
Externally publishedYes

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: lea@idc.ac.il (L. Epstein), vanstee@informatik.uni-freiburg.de (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
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Lower bounds for on-line single-machine scheduling'. Together they form a unique fingerprint.

Cite this