A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10133855" target="_blank" >RIV/00216208:11320/12:10133855 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-29116-6_9" target="_blank" >http://dx.doi.org/10.1007/978-3-642-29116-6_9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-29116-6_9" target="_blank" >10.1007/978-3-642-29116-6_9</a>

Result language
angličtina
Original language name
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
Original language description
We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions).
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Result description