Randomized online scheduling for two related machines.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05025169" target="_blank" >RIV/67985840:_____/01:05025169 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Randomized online scheduling for two related machines.
Original language description
We study the problem of online scheduling on two uniform machines. We present the first randomized results for this problem and demonstratethat the randomized competitive ratio is at most $1.52778$ for any $s$. Finaly, we present an optimal deterministiconline algorithm for the preemptive version of this problem.
Czech name
—
Czech description
—
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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Journal of scheduling
ISSN
1094-6136
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
71-92
UT code for WoS article
—
EID of the result in the Scopus database
—