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 条

[31] Three parallel machines scheduling with minimizing the maximum inter-completion time
Zheng, Feifeng
Sui, Yang
Xu, Yinfeng
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (04): : 1025 - 1036
[32] Minimizing flow time on a constant number of machines with preemption
Bansal, N
OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 267 - 273
[33] Minimizing job completion time variance for service stability on identical parallel machines
Li, Xueping
Chen, Yuerong
Sun, Yang
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (04) : 729 - 738
[34] Minimizing the total completion time on a parallel machine system with tool changes
Costa, A.
Cappadonna, F. A.
Fichera, S.
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 91 : 290 - 301
[35] Total completion time minimization scheduling on two hierarchical uniform machines
Zhou, Hao
Jiang, Yiwei
Zhou, Ping
Ji, Min
Zhao, Yun
THEORETICAL COMPUTER SCIENCE, 2017, 702 : 65 - 76
[36] Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Zhang, Qiang
Wu, Weiwei
Li, Minming
THEORETICAL COMPUTER SCIENCE, 2013, 507 : 34 - 40
[37] Parallel machine scheduling with a total energy consumption limitation for minimizing total completion time
Li, Kai
Xie, Fulong
Zhao, Xin
Chen, Jianfu
Zhou, Tao
ENGINEERING OPTIMIZATION, 2024,
[38] A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents
Lee, Wen-Chiung
Wang, Jen-Ya
Lin, Mei-Chun
KNOWLEDGE-BASED SYSTEMS, 2016, 105 : 68 - 82
[39] Scheduling open shops with parallel machines to minimize total completion time
Naderi, B.
Ghomi, S. M. T. Fatemi
Aminnayeri, M.
Zandieh, M.
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (05) : 1275 - 1287
[40] Minimizing the total completion time for parallel machine scheduling with job splitting and learning
Wang, Chenjie
Liu, Changchun
Zhang, Zhi-hai
Zheng, Li
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 97 : 170 - 182

← 1 2 3 4 5 →