Optimal and online preemptive scheduling on uniformly related machines

被引：10
|
作者：
Ebenlendr, Tomas [2 ]
Sgall, Jiri [1 ]
机构：
[1] Charles Univ Prague, Dept Appl Math, CR-11800 Prague 1, Czech Republic
[2] AS CR, Math Inst, Prague 11567 1, Czech Republic
来源：
JOURNAL OF SCHEDULING | 2009年 / 12卷 / 05期
关键词：
Online scheduling; Preemption; Uniformly related machines; MAKESPAN; BOUNDS;
D O I：
10.1007/s10951-009-0119-7
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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 e approximate to 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. Finally, we study the performance of greedy heuristics for the same problem.
引用
收藏
页码：517 / 527
页数：11
相关论文
共 50 条
12345