Randomized On-line Scheduling on 3 processors
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F04%3A00106818" target="_blank" >RIV/67985840:_____/04:00106818 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Randomized On-line Scheduling on 3 processors
Original language description
We consider a randomized on-line scheduling problem where each job has to be scheduled on any of $m$ identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for $m=3$ processors must be strictly greater than $27/19$.
Czech name
Pravděpodobnostní rozvrhování na 3 počítačích
Czech description
Článek studuje pravděpodobnostní rozvrhování na 3 počítačích.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
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
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
Name of the periodical
Operation Research Letters
ISSN
0167-6377
e-ISSN
—
Volume of the periodical
32
Issue of the periodical within the volume
2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
152-158
UT code for WoS article
—
EID of the result in the Scopus database
—