Feedback on the Current Page
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Tomas Ebenlendr and Jiri Sgall. Semi-Online Preemptive Scheduling: One Algorithm for All Variants. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 349-360, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ebenlendr_et_al:LIPIcs.STACS.2009.1840,
author = {Ebenlendr, Tomas and Sgall, Jiri},
title = {{Semi-Online Preemptive Scheduling: One Algorithm for All Variants}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {349--360},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1840},
URN = {urn:nbn:de:0030-drops-18406},
doi = {10.4230/LIPIcs.STACS.2009.1840},
annote = {Keywords: On-line algorithms, Scheduling}
}