Minimizing the total completion time on-line on a single machine, using restarts

被引：0
|
作者：
van Stee, R
La Poutré, H
机构：
[1] Univ Freiburg, Inst Informat, D-79110 Freiburg, Germany
[2] Ctr Math & Comp Sci, CWI, NL-1098 SJ Amsterdam, Netherlands
[3] Eindhoven Univ Technol, Sch Technol Management, NL-5600 MB Eindhoven, Netherlands
来源：
ALGORITHMS-ESA 2002, PROCEEDINGS | 2002年 / 2461卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We give an algorithm to minimize the total completion time on-line on a single machine, using restarts, with a competitive ratio of 3/2. The optimal competitive ratio without using restarts is 2 for deterministic algorithms and e/(e - 1) approximate to 1.582 for randomized algorithms. This is the first restarting algorithm to minimize the total completion time that is proved to be better than an algorithm that does not restart.
引用
收藏
页码：872 / 883
页数：12
相关论文
共 50 条
12345