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

被引：10

作者：

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

共 14 条

[1] Albers S, 2009, INTRO SCHEDULING, P57
[2] Online scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
[3] [冯琪 Feng Qi], 2007, [运筹学学报, OR Transactions], V11, P121
[4] A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine
Hoogeveen, JA
Vestjens, APA
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2000, 13 (01) : 56 - 63
[5] A Best Possible Online Algorithm for the Parallel-Machine Scheduling to Minimize the Maximum Weighted Completion Time
Li, Wenjie
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
[6] Two-agent scheduling to minimize the total cost
Nong, Q. Q.
Cheng, T. C. E.
Ng, C. T.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 215 (01) : 39 - 44
[7] Minimizing average completion time in the presence of release dates
Phillips, C
Stein, C
Wein, J
[J]. MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 199 - 223
[8] Online Over Time Scheduling on Parallel-Batch Machines: A Survey
Tian J.
Fu R.
Yuan J.
[J]. Journal of the Operations Research Society of China, 2014, 2 (4) : 445 - 454
[9] van den Akker M., 2000, Journal of Scheduling, V3, P333, DOI 10.1002/1099-1425(200011/12)3:6<333::AID-JOS53>3.0.CO
[10] 2-8

← 1 2 →