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

共 50 条

[1] On-line scheduling to minimize max flow time:: an optimal preemptive algorithm
Ambühl, C
Mastrolilli, M
OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 597 - 602
[2] An optimal on-line algorithm for preemptive scheduling on two uniform machines in the lp norm
Shuai, Tianping
Du, Donglei
Jiang, Xiaoyue
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 316 - +
[3] ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES
ZHANG Yuzhong (Institute of Operations Research
JournalofSystemsScienceandComplexity, 2001, (04) : 373 - 377
[4] A sub-optimal on-line scheduling algorithm with scheduling window
Shim, JH
Jung, GY
Choi, K
IEICE TRANSACTIONS ON COMMUNICATIONS, 2003, E86B (07) : 2232 - 2236
[5] Preemptive on-line scheduling for two uniform processors
Wen, JJ
Du, DL
OPERATIONS RESEARCH LETTERS, 1998, 23 (3-5) : 113 - 116
[6] Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Epstein, L
OPERATIONS RESEARCH LETTERS, 2001, 29 (02) : 93 - 98
[7] A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor
Vakhania, Nodari
PROCEEDINGS OF THE 2ND WSEAS INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS: MODERN TOPICS OF COMPUTER SCIENCE, 2008, : 158 - 161
[8] Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
Dósa, G
He, Y
COMPUTING, 2006, 76 (1-2) : 149 - 164
[9] Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines
G. Dósa
Y. He
Computing, 2006, 76 : 149 - 164
[10] A lower bound for the on-line preemptive machine scheduling with lp norm
Shuai, Tianping
Du, Donglei
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, 5092 : 661 - +

← 1 2 3 4 5 →