Number of the records: 1
KAM-DIMATA Series 2004-659 and ITI Series 2004-182. Online scheduling of equal-length jobs: Randomization and restarts help
- 1.0106812 - MU-W 20040019 RIV CZ eng V - Research Report
Chrobak, M. - Jawor, W. - Sgall, Jiří - Tichý, Tomáš
KAM-DIMATA Series 2004-659 and ITI Series 2004-182. Online scheduling of equal-length jobs: Randomization and restarts help.
[Online rozvrhování úloh stejné délky.]
Praha: Charles University, 2004. 20 s.
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z1019905
Keywords : online scheduling * deadlines * randomization
Subject RIV: BA - General Mathematics
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.
Permanent Link: http://hdl.handle.net/11104/0013986
Number of the records: 1