Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time

被引：11

作者：

Chai, Xing ^{[1
]}

Lu, Lingfa ^{[1
]}

Li, Wenhua ^{[1
]}

Zhang, Liqi ^{[2
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China

[2] Henan Agr Univ, Coll Informat & Management Sci, Zhengzhou 450003, Henan, Peoples R China

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2018年 / 35卷 / 06期

关键词：

Scheduling; online algorithm; best-possible; competitive ratio;

D O I：

10.1142/S0217595918500483

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider the online single machine scheduling problem to minimize the maximum weighted completion time of the jobs. For the preemptive problem, we show that the LW (Largest Weight first) rule yields an optimal schedule. For the non-preemptive problem, Li [Li, W (2015). A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific Journal of Operational Research, 32(4), 1550030 (10 pages)] presented a lower bound 2, and then provided an online algorithm with a competitive ratio of 3. In this paper, we present two online algorithms with the best-possible competitive ratio of 2 for the non-preemptive problem.

引用

页数：11

共 50 条

[31] Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
Ma, Ran
Tao, Jiping
Yuan, Jinjiang
APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 : 570 - 583
[32] Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time
Khuller, Samir
Li, Jingling
Sturmfels, Pascal
Sun, Kevin
Venkat, Prayaag
LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 669 - 682
[33] Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Chekuri, C
Motwani, R
DISCRETE APPLIED MATHEMATICS, 1999, 98 (1-2) : 29 - 38
[34] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Chai, Xing
Li, Wenhua
Zhu, Yuejuan
ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 79 - 93
[35] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Xing Chai
Wenhua Li
Yuejuan Zhu
Annals of Operations Research, 2021, 298 : 79 - 93
[36] Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
Crauwels, HAJ
Hariri, AMA
Potts, CN
Van Wassenhove, LN
ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) : 59 - 76
[37] An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
Pan, YP
OPERATIONS RESEARCH LETTERS, 2003, 31 (06) : 492 - 496
[38] Single-machine scheduling with operator non-availability to minimize total weighted completion time
Wan, Long
Yuan, Jinjiang
INFORMATION SCIENCES, 2018, 445 : 1 - 5
[39] SCHEDULING OF A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME SUBJECT TO RELEASE DATES
BIANCO, L
RICCIARDELLI, S
NAVAL RESEARCH LOGISTICS, 1982, 29 (01) : 151 - 167
[40] Unrelated parallel-machine scheduling to minimize total weighted completion time
Jeng-Fung Chen
Journal of Intelligent Manufacturing, 2015, 26 : 1099 - 1112

← 1 2 3 4 5 →