Preemptive scheduling in overloaded systems

Marek Chrobak, Leah Epstein, John Noga, Jiří Sgall, Rob Van Stee, Tomáš Tichý, Nodari Vakhania

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The following scheduling problem is studied: We are given a set of tasks withrelease times, deadlines, and profit rates. The objective is to determine a 1-processor preemptive schedule of the given tasks that maximizes the overall profit. In the standard model, each completed task brings profit, while non-completed tasks do not. In the metered model, a task brings profit proportional to the execution time even if not completed. For the metered task model, we present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms. Furthermore, we prove three lower bound results concerning resource augmentation in bothmo dels.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings
EditorsPeter Widmayer, Stephan Eidenbenz, Francisco Triguero, Rafael Morales, Ricardo Conejo, Matthew Hennessy
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540438645, 9783540438649
StatePublished - 2002
Externally publishedYes
Event29th International Colloquium on Automata, Languages, and Programming, ICALP 2002 - Malaga, Spain
Duration: 8 Jul 200213 Jul 2002

Publication series

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


Conference29th International Colloquium on Automata, Languages, and Programming, ICALP 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Preemptive scheduling in overloaded systems'. Together they form a unique fingerprint.

Cite this