Single-Machine Scheduling with Rejection and an Operator Non-Availability Interval

In this paper, we study two scheduling problems on a single machine with rejection and an operator non-availability interval. In the operator non-availability interval, no job can be started or be completed. However, a crossover job is allowed such that it can be started before this interval and completed after this interval. Furthermore, we also assume that job rejection is allowed. That is, each job is either accepted and processed in-house, or is rejected by paying a rejection cost. Our task is to minimize the sum of the makespan (or the total weighted completion time) of accepted jobs and the total rejection cost of rejected jobs. For two scheduling problems with different objective functions, by borrowing the previous algorithms in the literature, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme (FPTAS), respectively.

[1]  H. Kellerer.  Algorithms for multiprocessor scheduling with machine release times , 1998 .

[2]  Riad Aggoune,et al.  Two-Job Shop Scheduling Problems with Availability Constraints , 2004, ICAPS.

[3]  Erhan Kozan,et al.  Techniques for inserting additional trains into existing timetables , 2009 .

[4]  Guoqing Wang,et al.  Order acceptance and scheduling with machine availability constraints , 2014, Eur. J. Oper. Res..

[5]  Günter Schmidt,et al.  Scheduling Independent Tasks with Deadlines on Semi-identical Processors , 1988 .

[6]  Robert L. Burdett,et al.  A flexible job shop scheduling approach with operators for coal export terminals , 2019, Comput. Oper. Res..

[7]  Zhigang Cao,et al.  Scheduling with Rejection and Non-Identical Job Arrivals , 2007, J. Syst. Sci. Complex..

[8]  Jinjiang Yuan,et al.  Single machine scheduling with release dates and rejection , 2009, Eur. J. Oper. Res..

[9]  Imed Kacem.  Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval , 2009, J. Comb. Optim..

[10]  Hans Kellerer,et al.  Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval , 2016, J. Comb. Optim..

[11]  Chuanli Zhao,et al.  Single Machine Scheduling with an Availability Constraint and Rejection , 2014, Asia Pac. J. Oper. Res..

[12]  Vitaly A. Strusevich,et al.  Non-preemptive two-machine open shop scheduling with non-availability constraints , 2003, Math. Methods Oper. Res..

[13]  Lixin Shen,et al.  Parallel-machine scheduling with non-simultaneous machine available time , 2013 .

[14]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[15]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[16]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

[17]  Sudipta Sengupta,et al.  Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection , 2003, WADS.

[18]  Yong Chen,et al.  Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time , 2013, Inf. Sci..

[19]  Gerd Finke,et al.  Operator non-availability periods , 2009, 4OR.

[20]  Long Wan,et al.  Single-machine scheduling with operator non-availability to minimize total weighted completion time , 2018, Inf. Sci..

[21]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[22]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[23]  Shi-Sheng Li,et al.  Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine , 2017, Asia Pac. J. Oper. Res..

[24]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

[25]  David R. Karger,et al.  Techniques for scheduling with rejection , 1998, J. Algorithms.

[26]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[27]  Dvir Shabtay,et al.  A survey on offline scheduling with rejection , 2013, J. Sched..