Lower bounds for on-line single-machine scheduling

Leah Epstein, Rob van Stee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationMathematical Foundations of Computer Science 2001 - 26th International Symposium, MFCS 2001, Proceedings
EditorsJiri Sgall, Ales Pultr, Petr Kolman
PublisherSpringer Verlag
Pages338-350
Number of pages13
ISBN (Print)9783540446835
DOIs
StatePublished - 2001
Externally publishedYes
Event26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001 - Marianske Lazne, Czech Republic
Duration: 27 Aug 200131 Aug 2001

Publication series

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

Conference

Conference26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001
Country/TerritoryCzech Republic
CityMarianske Lazne
Period27/08/0131/08/01

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.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

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