Optimal and online preemptive scheduling on uniformly related machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F04%3A00106815" target="_blank" >RIV/67985840:_____/04:00106815 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimal and online preemptive scheduling on uniformly related machines
Original language description
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2,71 competitive randomized online algorithms. In addition, it matches the performance.
Czech name
—
Czech description
—
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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
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 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)
ISBN
3-540-21236-1
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
SpringerVerlag
Place of publication
Berlin
Event location
Montpellier
Event date
Mar 25, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000189497100018