Minimizing the total completion time on-line on a single machine, using restarts

被引：0
|
作者：
van Stee, R
La Poutré, H
机构：
[1] Univ Freiburg, Inst Informat, D-79110 Freiburg, Germany
[2] Ctr Math & Comp Sci, CWI, NL-1098 SJ Amsterdam, Netherlands
[3] Eindhoven Univ Technol, Sch Technol Management, NL-5600 MB Eindhoven, Netherlands
来源：
ALGORITHMS-ESA 2002, PROCEEDINGS | 2002年 / 2461卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We give an algorithm to minimize the total completion time on-line on a single machine, using restarts, with a competitive ratio of 3/2. The optimal competitive ratio without using restarts is 2 for deterministic algorithms and e/(e - 1) approximate to 1.582 for randomized algorithms. This is the first restarting algorithm to minimize the total completion time that is proved to be better than an algorithm that does not restart.
引用
收藏
页码：872 / 883
页数：12
相关论文
共 50 条
  • [41] Minimizing total weighted completion time with an unexpected machine unavailable interval
    Huo, Yumei
    Reznichenko, Boris
    Zhao, Hairong
    JOURNAL OF SCHEDULING, 2014, 17 (02) : 161 - 172
  • [42] Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm
    N. Sivarami Reddy
    D. V. Ramamurthy
    M. Padma Lalitha
    K. Prahlada Rao
    Soft Computing, 2022, 26 : 1437 - 1458
  • [43] Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm
    Reddy, N. Sivarami
    Ramamurthy, D., V
    Lalitha, M. Padma
    Rao, K. Prahlada
    SOFT COMPUTING, 2022, 26 (03) : 1437 - 1458
  • [44] Minimizing total weighted completion time in semiresumable case of single-machine scheduling with an availability constraint
    Ma, Ying
    Chu, Cheng-Bin
    Yang, Shan-Lin
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2009, 29 (02): : 134 - 143
  • [45] Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
    Gyorgyi, Peter
    Kis, Tamas
    JOURNAL OF SCHEDULING, 2019, 22 (06) : 623 - 634
  • [46] Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
    Péter Györgyi
    Tamás Kis
    Journal of Scheduling, 2019, 22 : 623 - 634
  • [47] Parallel machine scheduling with a total energy consumption limitation for minimizing total completion time
    Li, Kai
    Xie, Fulong
    Zhao, Xin
    Chen, Jianfu
    Zhou, Tao
    ENGINEERING OPTIMIZATION, 2024,
  • [48] Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance
    Tsai, Ya-Chih
    Chen, Yarong
    Chou, Fuh-Der
    ICRAI 2018: PROCEEDINGS OF 2018 4TH INTERNATIONAL CONFERENCE ON ROBOTICS AND ARTIFICIAL INTELLIGENCE -, 2018, : 34 - 39
  • [49] A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
    Layegh, Jalil
    Jolai, Fariborz
    Amalnik, Mohsen Sadegh
    ADVANCES IN ENGINEERING SOFTWARE, 2009, 40 (10) : 1074 - 1077
  • [50] A class of on-line scheduling algorithms to minimize total completion time
    Lu, X
    Sitters, RA
    Stougie, L
    OPERATIONS RESEARCH LETTERS, 2003, 31 (03) : 232 - 236
12345