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 条
  • [21] Minimizing maximum delivery completion time for order scheduling with rejection
    Chen, Ren-Xia
    Li, Shi-Sheng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (04) : 1044 - 1064
  • [22] Minimizing maximum delivery completion time for order scheduling with rejection
    Ren-Xia Chen
    Shi-Sheng Li
    Journal of Combinatorial Optimization, 2020, 40 : 1044 - 1064
  • [23] Scheduling to minimize the maximum total completion time per machine
    Wan, Long
    Ding, Zhihao
    Li, Yunpeng
    Chen, Qianqian
    Tan, Zhiyi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (01) : 45 - 50
  • [24] Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost
    Lu, Lingfa
    Zhang, Liqi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 46 (01)
  • [25] Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost
    Lingfa Lu
    Liqi Zhang
    Journal of Combinatorial Optimization, 2023, 46
  • [26] 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
  • [27] 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
  • [28] Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability
    Kacem, Imed
    Paschos, Vangelis Th.
    DISCRETE OPTIMIZATION, 2013, 10 (01) : 61 - 68
  • [29] Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
    Yin, Yunqiang
    Ye, Deshi
    Zhang, Guochuan
    INFORMATION SCIENCES, 2014, 274 : 310 - 322
  • [30] Two-machine Flowshop Problem with Release dates, Rejection and Non-availability Interval on the First Machine
    Xie, Xie
    Kong, Xiangyu
    Zheng, Yongyue
    Wei, Kun
    INDUSTRIAL ENGINEERING AND APPLIED RESEARCH, 2014, 620 : 80 - +
12345