On-Line Single Machine Scheduling of Unit Time Jobs with Rejection: Minimizing the Maximum Quadratic Completion Time

被引：0
|
作者：
Zhang, Liqi [1 ]
Lu, Lingfa [2 ]
Sun, Xueke [2 ]
Zuo, Lili [2 ]
机构：
[1] Henan Agr Univ, Coll Informat & Management Sci, Zhengzhou 450003, Henan, Peoples R China
[2] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
来源：
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2025年
基金：
中国国家自然科学基金;
关键词：
Scheduling with rejection; the maximum quadratic completion time; on-line algorithm; competitive ratio;
D O I：
10.1142/S0217595925500095
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the on-line single machine scheduling of unit time jobs with rejection. All jobs arrive on-line over a list (one by one). For each arriving job, the on-line algorithm must decide immediately to accept or reject it. The objective is to minimize the maximum quadratic completion time of accepted jobs plus the total rejection cost of rejected jobs. For this problem, we show that 1.7299 is a lower bound on the competitive ratio and present a simple greedy algorithm with the competitive ratio 2. Furthermore, we also provide a modified greedy algorithm with a better competitive ratio 1 + root 3/2 approximate to 1.86602.
引用
收藏
页数：10
相关论文
共 50 条
  • [21] Minimizing the maximum starting time on-line
    Epstein, L
    van Stee, R
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 449 - 460
  • [22] Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time
    Gil-Gala, Francisco J.
    Mencia, Carlos
    Sierra, Maria R.
    Varela, Ramiro
    APPLIED SOFT COMPUTING, 2019, 85
  • [23] On-line scheduling with delivery time on a single batch machine
    Tian, Ji
    Fu, Ruyan
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 49 - 57
  • [24] Approximability of single machine scheduling with fixed jobs to minimize total completion time
    Yuan, J. J.
    Lin, Y. X.
    Ng, C. T.
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (01) : 46 - 56
  • [25] A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
    Ocetkiewicz, Krzysztof M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (02) : 316 - 320
  • [26] On minimizing total completion time in batch machine scheduling
    Poon, CK
    Cu, WC
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (04) : 593 - 607
  • [27] Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
    Cheng He
    Hao Lin
    Xiumei Wang
    4OR, 2014, 12 : 87 - 93
  • [28] Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
    He, Cheng
    Lin, Hao
    Wang, Xiumei
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2014, 12 (01): : 87 - 93
  • [29] Minimizing maximum earliness in single-machine scheduling with flexible maintenance time
    Ganji, F.
    Moslehi, Gh.
    Jeddi, B. Ghalebsaz
    SCIENTIA IRANICA, 2017, 24 (04) : 2082 - 2094
  • [30] Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time
    Chen, Yarong
    Su, Ling-Huey
    Tsai, Ya-Chih
    Huang, Shenquan
    Chou, Fuh-Der
    IEEE ACCESS, 2019, 7 : 22290 - 22300
12345