Preemptive Online Scheduling: Optimal Algorithms for All Speeds
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F06%3A00076019" target="_blank" >RIV/67985840:_____/06:00076019 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Original language description
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between $2.0545$ and $e/approx 2.718$.
Czech name
Preemptivní online rozvrhování: Optimální algoritmy pro všechny rychlosti
Czech description
Článek studuje optimální online algoritmy pro preemptivní rozvrhování.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 14th European Symposium on Algorithms (ESA)
ISBN
3-540-38875-3
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
327-339
Publisher name
Springer
Place of publication
Berlin
Event location
Zurich
Event date
Sep 11, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—