Optimal and online preemptive scheduling on uniformly related machines

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207315" target="_blank" >RIV/00216208:11320/09:00207315 - isvavai.cz</a>

Alternative codes found

RIV/67985840:_____/09:00334957

Result on the web

—

DOI - Digital Object Identifier

—

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 semionline 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 an 2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known algorithms for the offline case, with a considerably simpler proof.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

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)

Publication year

2009

Confidentiality

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

Name of the periodical

Journal of Scheduling

ISSN

1094-6136

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

5

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

11

Pages from-to

—

UT code for WoS article

000270340900008

EID of the result in the Scopus database

—