@inproceedings{75802e9bd7294157961e4bde6c49bf20,
title = "Preemptive scheduling in overloaded systems",
abstract = "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.",
author = "Marek Chrobak and Leah Epstein and John Noga and Ji{\v r}{\'i} Sgall and {Van Stee}, Rob and Tom{\'a}{\v s} Tich{\'y} and Nodari Vakhania",
year = "2002",
doi = "10.1007/3-540-45465-9_68",
language = "English",
isbn = "3540438645",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "800--811",
editor = "Peter Widmayer and Stephan Eidenbenz and Francisco Triguero and Rafael Morales and Ricardo Conejo and Matthew Hennessy",
booktitle = "Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings",
address = "Germany",
note = "29th International Colloquium on Automata, Languages, and Programming, ICALP 2002 ; Conference date: 08-07-2002 Through 13-07-2002",
}