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 条
  • [21] A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time"
    Yu, Sheng
    Wong, Prudence W. H.
    INFORMATION PROCESSING LETTERS, 2012, 112 (1-2) : 55 - 58
  • [22] Single machine scheduling to minimize weighted earliness subject to maximum tardiness
    Chen, TS
    Qi, XT
    Tu, FS
    COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (02) : 147 - 152
  • [23] A note on lot scheduling on a single machine to minimize maximum weighted tardiness
    Gur Mosheiov
    Assaf Sarig
    Journal of Combinatorial Optimization, 2023, 45
  • [24] Single machine scheduling to minimize weighted earliness subject to maximum tardiness
    Tsiushuang, Chen
    Xiangtong, Qi
    Fengsheng, Tu
    Computers and Operations Research, 1997, 24 (02): : 147 - 152
  • [25] A note on lot scheduling on a single machine to minimize maximum weighted tardiness
    Mosheiov, Gur
    Sarig, Assaf
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (05)
  • [26] A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
    Jiao, Chengwen
    Li, Wenhua
    Yuan, Jinjiang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (04)
  • [27] Online scheduling on m uniform machines to minimize total (weighted) completion time
    Liu, Ming
    Chu, Chengbiu
    Xu, Yinfeng
    Zheng, Feifeng
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3875 - 3881
  • [28] Select and permute: An improved online framework for scheduling to minimize weighted completion time
    Khuller, Samir
    Li, Jingling
    Sturmfels, Pascal
    Sun, Kevin
    Venkat, Prayaag
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 420 - 431
  • [29] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ma, Ran
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 483 - 503
  • [30] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ran Ma
    Jinjiang Yuan
    Journal of Combinatorial Optimization, 2017, 34 : 483 - 503
12345