A lower bound for on-line scheduling on uniformly related machines

被引：35
|
作者：
Epstein, L
Sgall, J
机构：
[1] AS CR, Math Inst, CZ-11567 Prague 1, Czech Republic
[2] Tel Aviv Univ, Dept Comp Sci, IL-69978 Tel Aviv, Israel
[3] Charles Univ Prague, Fac Math & Phys, Dept Math Appl, Prague, Czech Republic
来源：
OPERATIONS RESEARCH LETTERS | 2000年 / 26卷 / 01期
关键词：
on-line scheduling; preemption; uniformly related machines;
D O I：
10.1016/S0167-6377(99)00062-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：17 / 22
页数：6
相关论文
共 50 条
12345