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 条

[1] Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
Ma, Ran
Yuan, Jinjiang
INFORMATION PROCESSING LETTERS, 2013, 113 (17) : 593 - 598
[2] Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time
Chen, Yong
Zhang, An
Tan, Zhiyi
FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011, 6681 : 208 - 219
[3] Single machine scheduling with non-availability interval and optional job rejection
Baruch Mor
Dana Shapira
Journal of Combinatorial Optimization, 2022, 44 : 480 - 497
[4] Single-Machine Scheduling with Rejection and an Operator Non-Availability Interval
Zuo, Lili
Sun, Zhenxia
Lu, Lingfa
Zhang, Liqi
MATHEMATICS, 2019, 7 (08)
[5] The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
Shabtay, Dvir
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 233 (01) : 64 - 74
[6] Single machine scheduling with non-availability interval and optional job rejection
Mor, Baruch
Shapira, Dana
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 480 - 497
[7] Single-machine scheduling with operator non-availability to minimize total weighted completion time
Wan, Long
Yuan, Jinjiang
INFORMATION SCIENCES, 2018, 445 : 1 - 5
[8] Online scheduling to minimize the total weighted completion time plus the rejection cost
Ran Ma
Jinjiang Yuan
Journal of Combinatorial Optimization, 2017, 34 : 483 - 503
[9] Online scheduling to minimize the total weighted completion time plus the rejection cost
Ma, Ran
Yuan, Jinjiang
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 483 - 503
[10] Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
Chen, Yong
Zhang, An
Tan, Zhiyi
INFORMATION SCIENCES, 2013, 251 : 150 - 163

← 1 2 3 4 5 →