Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1840
URN: urn:nbn:de:0030-drops-18406
URL: https://drops.dagstuhl.de/opus/volltexte/2009/1840/
Ebenlendr, Tomas ; Sgall, Jiri
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
| pdf-format: |
|
Abstract
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.
BibTeX - Entry
@InProceedings{ebenlendr_et_al:LIPIcs:2009:1840,
author = {Tomas Ebenlendr and Jiri Sgall},
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 = {Susanne Albers and Jean-Yves Marion},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1840},
URN = {urn:nbn:de:0030-drops-18406},
doi = {10.4230/LIPIcs.STACS.2009.1840},
annote = {Keywords: On-line algorithms, Scheduling}
}
| Keywords: | On-line algorithms, Scheduling | |
| Seminar: | 26th International Symposium on Theoretical Aspects of Computer Science | |
| Issue date: | 2009 | |
| Date of publication: | 19.02.2009 |
