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 条

[1] A Best Possible Online Algorithm for the Parallel-Machine Scheduling to Minimize the Maximum Weighted Completion Time
Li, Wenjie
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
[2] Online scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
[3] Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time
Ma, Ran
Yuan, Jinjiang
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 158 : 114 - 119
[4] Online Scheduling on Bounded Batch Machines to Minimize the Maximum Weighted Completion Time
Li W.-H.
Chai X.
Journal of the Operations Research Society of China, 2018, 6 (3) : 455 - 465
[5] Online Single Machine Scheduling to Minimize the Maximum Starting Time
Lu, Lingfa
Zhang, Liqi
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (05)
[6] Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
Fang, Yang
Lu, Xiwen
INFORMATION PROCESSING LETTERS, 2016, 116 (08) : 526 - 531
[7] Single machine lot scheduling to minimize the total weighted (discounted) completion time
Zhang, E.
Liu, Ming
Zheng, Feifeng
Xu, Yinfeng
INFORMATION PROCESSING LETTERS, 2019, 142 : 46 - 51
[8] On-line scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 548 - 557
[9] A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Tao, Jiping
COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 215 - 224
[10] Scheduling to minimize the maximum total completion time per machine
Wan, Long
Ding, Zhihao
Li, Yunpeng
Chen, Qianqian
Tan, Zhiyi
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (01) : 45 - 50

← 1 2 3 4 5 →