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 条
  • [41] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
    Chen, Yarong
    Guan, Zailin
    Tsai, Ya-Chih
    Chou, Fuh-Der
    IEEE Access, 2022, 10 : 45444 - 45456
  • [42] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
    Chen, Yarong
    Guan, Zailin
    Tsai, Ya-Chih
    Chou, Fuh-Der
    IEEE ACCESS, 2022, 10 : 45444 - 45456
  • [43] Unrelated parallel-machine scheduling to minimize total weighted completion time
    Chen, Jeng-Fung
    JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (06) : 1099 - 1112
  • [44] Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
    Qijia Liu
    Jinjiang Yuan
    Journal of Combinatorial Optimization, 2016, 32 : 385 - 395
  • [45] Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
    Liu, Qijia
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (02) : 385 - 395
  • [46] Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
    Liu, Zhimeng
    Li, Shuguang
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (07) : 7337 - 7348
  • [47] Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
    Batsyn, Mikhail
    Goldengorin, Boris
    Pardalos, Panos M.
    Sukhov, Pavel
    OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (05): : 955 - 963
  • [48] Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
    Lee, Kangbok
    Choi, Byung-Cheon
    Leung, Joseph Y. -T.
    Pinedo, Michael L.
    INFORMATION PROCESSING LETTERS, 2009, 109 (16) : 913 - 917
  • [49] Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Shu-Xia
    Cao, Zhi-Gang
    Zhang, Yu-Zhong
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 111 - +
  • [50] Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
    Kacem, Imed
    Chu, Chengbin
    Souissi, Ahmed
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) : 827 - 844
12345