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 条
  • [1] Minimizing the total completion time on-line on a single machine, using restarts
    van Stee, R
    La Poutré, H
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 57 (02): : 95 - 129
  • [2] On-line scheduling on a single machine: minimizing the total completion time
    Amos Fiat
    Gerhard J. Woeginger
    Acta Informatica, 1999, 36 : 287 - 293
  • [3] On-line scheduling on a single machine: minimizing the total completion time
    Fiat, A
    Woeginger, GJ
    ACTA INFORMATICA, 1999, 36 (04) : 287 - 293
  • [4] 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
  • [5] On-Line Single Machine Scheduling of Unit Time Jobs with Rejection: Minimizing the Maximum Quadratic Completion Time
    Zhang, Liqi
    Lu, Lingfa
    Sun, Xueke
    Zuo, Lili
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2025,
  • [6] Heuristics for minimizing total completion time on single machine with release time
    Oyetunji, E. O.
    Oluleye, A. E.
    ADVANCES IN MATERIALS AND SYSTEMS TECHNOLOGIES, 2007, 18-19 : 347 - 352
  • [7] On-line scheduling of unit time jobs with rejection: minimizing the total completion time
    Epstein, L
    Noga, J
    Woeginger, GJ
    OPERATIONS RESEARCH LETTERS, 2002, 30 (06) : 415 - 420
  • [8] Restarts can help in the on-line minimization of the maximum delivery time on a single machine
    Van, den Akker, Marjan
    Hoogeveen, Han
    Vakhania, Nodari
    Journal of Scheduling, 2000, 3 (06) : 333 - 341
  • [9] Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance
    Huang, Shenquan
    Zhou, Hongming
    Tsai, Ya-Chih
    Chen, Yarong
    Chou, Fuh-Der
    IEEE ACCESS, 2019, 7 : 122164 - 122182
  • [10] Minimizing total completion time on a single machine with a flexible maintenance activity
    Yang, Shan-lin
    Ma, Ying
    Xu, Dong-ling
    Yang, Jian-bo
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (04) : 755 - 770
12345