Original title: KAM-DIMATA Series 2004-659 and ITI Series 2004-182. Online scheduling of equal-length jobs: Randomization and restarts help
Translated title: Online rozvrhování úloh stejné délky
Authors: Chrobak, M. ; Jawor, W. ; Sgall, Jiří ; Tichý, Tomáš
Document type: Research reports
Year: 2004
Language: eng
Abstract: [eng] [cze]
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. Článek studuje online rozvrhování úloh stejné délky.
Keywords: deadlines; online scheduling; randomization
Project no.: CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), IAA1019401 (CEP)
Funding provider: GA MŠk, GA AV ČR

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0013986

Permalink: http://www.nusl.cz/ntk/nusl-20175


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports