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 条

[41] Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
Wang, Ji-Bo
Wang, Ming-Zheng
Ji, Ping
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2012, 43 (05) : 861 - 868
[42] A Best On-line Algorithm for Single Machine Scheduling the Equal Length Jobs with the Special Chain Precedence and Delivery Time
Gu, Cunchang
Mu, Yundong
INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768
[43] On-line scheduling to minimize average completion time revisited
Megow, N
Schulz, AS
OPERATIONS RESEARCH LETTERS, 2004, 32 (05) : 485 - 490
[44] Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Vakhania, Nodari
Werner, Frank
THEORETICAL COMPUTER SCIENCE, 2013, 501 : 72 - 81
[45] Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
Kuo, Wen-Hung
Yang, Dar-Li
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (02) : 1184 - 1190
[46] Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
Luo R.-Z.
Sun S.-J.
Journal of Zhejiang University-SCIENCE A, 2005, 6 (6): : 591 - 595
[47] Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
罗润梓
孙世杰
JournalofZhejiangUniversityScienceA(ScienceinEngineering), 2005, (06) : 591 - 595
[48] Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
John, Thuruthickara C., 1600, (16):
[49] 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
[50] 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

← 1 2 3 4 5 →