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.
|Title of host publication||Mathematical Foundations of Computer Science 2001 - 26th International Symposium, MFCS 2001, Proceedings|
|Editors||Jiri Sgall, Ales Pultr, Petr Kolman|
|Number of pages||13|
|State||Published - 2001|
|Event||26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001 - Marianske Lazne, Czech Republic|
Duration: 27 Aug 2001 → 31 Aug 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001|
|Period||27/08/01 → 31/08/01|
Bibliographical noteFunding 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: firstname.lastname@example.org (L. Epstein), email@example.com (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.
© Springer-Verlag Berlin Heidelberg 2001.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)