Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval

We consider two parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time, jobs can be rejected by paying penalties and the first machine has a fixed non-availability interval. The objective is to minimize the makespan of the accepted jobs plus the total penalty of the rejected jobs. We present a fully polynomial-time approximation scheme (FPTAS) for the case with two identical machines. The time complexity of the FPTAS is O(n^6L^4/@e^3) where n is the number of jobs and L is the input size, @e is the error bound.

[1]  T.C.E. Cheng,et al.  Scheduling start time dependent jobs to minimize the total weighted completion time , 2002, J. Oper. Res. Soc..

[2]  T. C. Edwin Cheng,et al.  Scheduling with job-dependent learning effects and multiple rate-modifying activities , 2010, Inf. Process. Lett..

[3]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling with simple linear deterioration to minimize total completion time , 2008, Eur. J. Oper. Res..

[4]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5]  T. C. Edwin Cheng,et al.  Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan , 2010, Comput. Ind. Eng..

[6]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs , 1998, J. Heuristics.

[7]  C. T. Ng,et al.  A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs , 2007 .

[8]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

[9]  Zhi-Long Chen.  Parallel Machine Scheduling with Time Dependent Processing Times , 1996, Discret. Appl. Math..

[10]  T. C. Edwin Cheng,et al.  Unrelated parallel-machine scheduling with deteriorating maintenance activities , 2011, Comput. Ind. Eng..

[11]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

[12]  Shijie Sun,et al.  Scheduling linear deteriorating jobs with rejection on a single machine , 2009, Eur. J. Oper. Res..

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

[14]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[15]  T. C. Edwin Cheng,et al.  Single-machine scheduling with periodic maintenance to minimize makespan , 2007, Comput. Oper. Res..

[16]  Jinjiang Yuan,et al.  Parallel-machine scheduling with deteriorating jobs and rejection , 2010, Theor. Comput. Sci..