A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10316162" target="_blank" >RIV/00216208:11320/15:10316162 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/15:00440693
Result on the web
<a href="http://dx.doi.org/10.1007/s00224-013-9451-6" target="_blank" >http://dx.doi.org/10.1007/s00224-013-9451-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-013-9451-6" target="_blank" >10.1007/s00224-013-9451-6</a>
Alternative languages
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 consider one-by-one online scheduling on uniformly related machines. The input is a sequence of machines with different speeds and a sequence of jobs with different processing times. The output is a schedule which assigns the jobs to the machines; thecompletion time of a machine is the sum of the processing times of jobs assigned to it divided by its speed. The objective is to minimize the maximal completion time. The jobs arrive one by one and each has to be assigned to one machine immediately andirrevocably without the knowledge of the future jobs. We prove a new lower bound of 2.564 on the competitive ratio of deterministic online algorithms for this problem, improving the previous lower bound of 2.438.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Name of the periodical
Theory of Computing Systems
ISSN
1432-4350
e-ISSN
—
Volume of the periodical
56
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
73-81
UT code for WoS article
000348448100005
EID of the result in the Scopus database
2-s2.0-84957968096