An optimal algorithm for preemptive on-line scheduling

被引：57

作者：

Chen, B

vanVliet, A

Woeginger, GJ

机构：

[1] ERASMUS UNIV ROTTERDAM,INST ECONOMETR,3000 DR ROTTERDAM,NETHERLANDS

[2] GRAZ TECH UNIV,INST MATH,A-8010 GRAZ,AUSTRIA

来源：

OPERATIONS RESEARCH LETTERS | 1995年 / 18卷 / 03期

关键词：

scheduling; preemption; on-line algorithms; worst-case bounds;

D O I：

10.1016/0167-6377(95)00039-9

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the makespan. We derive an approximation algorithm with worst-case guarantee m(m)/(m(m) - (m - 1)(m)) for every m greater than or equal to 2, which increasingly tends to e/(e - 1) approximate to 1.58 as m --> infinity. Moreover, we prove that for no m greater than or equal to 2 there does exist any approximation algorithm with a better worst-case guarantee.

引用

页码：127 / 131

页数：5