POWER OF PREEMPTION FOR MINIMIZING TOTAL COMPLETION TIME ON UNIFORM PARALLEL MACHINES

被引：8

作者：

Epstein, Leah ^{[1
]}

Levin, Asaf ^{[2
]}

Soper, Alan J. ^{[3
]}

Strusevich, Vitaly A. ^{[3
]}

机构：

[1] Univ Haifa, Dept Math, IL-3498838 Haifa, Israel

[2] The Technion, Fac Ind Engn & Management, IL-32000 Haifa, Israel

[3] Univ Greenwich, Dept Math Sci, London SE10 9LS, England

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2017年 / 31卷 / 01期

关键词：

scheduling; total completion time; power of preemption; uniformly related machines; UNRELATED MACHINES; LIMITED NUMBER; PROCESSORS; ALGORITHMS;

D O I：

10.1137/16M1066610

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For scheduling problems on parallel machines, the power of preemption is defined as the supremum ratio of the cost of an optimal nonpreemptive schedule over the cost of an optimal preemptive schedule (for the same input), where the cost is defined by a fixed common cost function. We present a tight analysis of the power of preemption for the problem of minimizing the total completion time on m >= 2 uniformly related machines, showing that its value for m = 2 is equal to 1.2, and its overall value is approximately 1.39795.

引用

页码：101 / 123

页数：23

共 50 条

[1] Minimizing Total Completion Time on Uniform Machines with Deadline Constraints
Gonzalez, Teofilo F.
Leung, Joseph Y. -T.
Pinedo, Michael
ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (01) : 95 - 115
[2] Minimizing total completion time on parallel machines with deadline constraints
Leung, JYT
Pinedo, M
SIAM JOURNAL ON COMPUTING, 2003, 32 (05) : 1370 - 1388
[3] Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch
Miao, Cuixia
Zhang, Yu-Zhong
Ren, Jianfeng
OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 402 - 408
[4] Minimizing total weighted completion time on parallel unbounded batch machines
School of Mathematics and Systems Science, Shandong University, Ji'nan 250100, China
不详
不详
不详
Ruan Jian Xue Bao, 2006, 10 (2063-2068):
[5] Minimizing total weighted completion time on identical parallel batch machines
Li, Shuguang
Li, Guojun
Qi, Xingqin
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1441 - 1453
[6] Minimizing time-dependent total completion time on parallel identical machines
Gawiejnowicz, S
Kurc, W
Pankowska, L
PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 89 - 96
[7] A PTAS for minimizing the total weighted completion time on identical parallel machines
Skutella, M
Woeginger, GJ
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) : 63 - 75
[8] A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines
Chu Xuyang
Tao Jiping
MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020 (2020)
[9] Minimizing the total weighted completion time on unrelated parallel machines with stochastic times
Arnaout, JPM
Rabadi, G
PROCEEDINGS OF THE 2005 WINTER SIMULATION CONFERENCE, VOLS 1-4, 2005, : 2141 - 2147
[10] Serial batch scheduling on uniform parallel machines to minimize total completion time
Li, Song-Song
Zhang, Yu-Zhong
INFORMATION PROCESSING LETTERS, 2014, 114 (12) : 692 - 695

← 1 2 3 4 5 →