Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost

被引：0

作者：

Zuo, Lili ^{[1
]}

Lu, Lingfa ^{[1
]}

Zhang, Liqi ^{[2
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou, Henan, Peoples R China

[2] Henan Agr Univ, Coll Informat & Management Sci, Zhengzhou, Henan, Peoples R China

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2023年 / 40卷 / 05期

关键词：

Scheduling with rejection; machine non-availability; operator non-availability; dynamic programming; FPTAS; APPROXIMATION ALGORITHMS;

D O I：

10.1142/S0217595923400171

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider the single machine scheduling with rejection and a non-availability interval. Two types of non-availability intervals are studied, namely the machine non-availability (MNA) intervals and the operator non-availability (ONA) intervals. The objective is to minimize the sum of the maximum delivery completion time of accepted jobs and the total rejection cost of rejected jobs. For these two problems, a pseudo-polynomial-time dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS) are proposed, respectively.

引用

页数：11

共 50 条

[31] Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Lu, Lingfa
Zhang, Liqi
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 331 - 342
[32] Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Lingfa Lu
Liqi Zhang
Journal of Combinatorial Optimization, 2017, 34 : 331 - 342
[33] Scheduling problems with rejection to minimize the maximum flow time
Liqi Zhang
Lingfa Lu
Journal of Systems Science and Complexity, 2016, 29 : 1293 - 1301
[34] Scheduling Problems with Rejection to Minimize the Maximum Flow Time
ZHANG Liqi
LU Lingfa
Journal of Systems Science & Complexity, 2016, 29 (05) : 1293 - 1301
[35] Scheduling Problems with Rejection to Minimize the Maximum Flow Time
Zhang Liqi
Lu Lingfa
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (05) : 1293 - 1301
[36] Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
Kellerer, Hans
Kubzin, Mikhail A.
Strusevich, Vitaly A.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (01) : 111 - 116
[37] Single Machine Scheduling with an Availability Constraint and Rejection
Zhao, Chuanli
Tang, Hengyong
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (05)
[38] Online scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
[39] 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,
[40] Maximum Lateness Minimization with Positive Tails on a Single Machine with an Unexpected Non-Availability Interval
Kacem, Imed
Nagih, Anass
Seifaddini, Maryam
2014 WORLD CONGRESS ON COMPUTER APPLICATIONS AND INFORMATION SYSTEMS (WCCAIS), 2014,

← 1 2 3 4 5 →