Online scheduling of equal-length jobs: Randomization and restarts help
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F04%3A00106922" target="_blank" >RIV/67985840:_____/04:00106922 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Online scheduling of equal-length jobs: Randomization and restarts help
Original language description
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule of these jobs that maximizes the number of completed jobs. In the online version, each job arrives at its release time.
Czech name
Online rozvrhování úloh stejné délky
Czech description
Článek studuje online rozvrhování úloh stejné délky.
Classification
Type
D - Article in proceedings
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
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
Article name in the collection
Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP)
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
358-370
Publisher name
Springer
Place of publication
Berlin
Event location
Turku
Event date
Jul 12, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—