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
关键词
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 条
  • [11] Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines
    Ma R.
    Yuan J.-J.
    Journal of the Operations Research Society of China, 2016, 4 (1) : 111 - 119
  • [12] Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost
    Yin, Yunqiang
    Cheng, Tai Chiu Edwin
    Wang, Dujuan
    Wu, Chin-Chia
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2016, 46 (11): : 1578 - 1588
  • [13] Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
    Li W.-X.
    Zhao C.-L.
    Journal of Applied Mathematics and Computing, 2015, 48 (1-2) : 585 - 605
  • [14] Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Shu-Xia
    Cao, Zhi-Gang
    Zhang, Yu-Zhong
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 111 - +
  • [15] New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Liqi
    Yu, Xue
    Lu, Lingfa
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 75 - 94
  • [16] Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval
    Zhang, Minjiao
    Luo, Chengxin
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 224 : 405 - 411
  • [17] An FPTAS for Uniform Machine Scheduling to Minimize The Total Completion Time and The Total Rejection Penalty
    Wu, Dan
    Luo, Chengxin
    ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING II, PTS 1-3, 2013, 433-435 : 2339 - 2342
  • [18] Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
    Atsmony, Matan
    Mosheiov, Gur
    OPTIMIZATION LETTERS, 2024, 18 (03) : 751 - 766
  • [19] Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
    Matan Atsmony
    Gur Mosheiov
    Optimization Letters, 2024, 18 : 751 - 766
  • [20] Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
    He, Cheng
    Leung, Joseph Y. -T.
    Lee, Kangbok
    Pinedo, Michael L.
    DISCRETE APPLIED MATHEMATICS, 2016, 204 : 150 - 163