Scheduling linear deteriorating jobs with rejection on a single machine

We consider several single machine scheduling problems in which the processing time of a job is a linear function of its starting time and jobs can be rejected by paying penalties. The objectives are to minimize the makespan, the total weighted completion time and the maximum lateness/tardiness plus the total penalty of the rejected jobs. We show that these problems are NP-hard, and design algorithms based on dynamic programming (including pseudo-polynomial time optimal algorithms and fully polynomial time approximation schemes) to solve them.

[1]  Y. He,et al.  Solving second order ordinary differential equations with maximal symmetry group , 1999 .

[2]  Adam Janiak,et al.  Minimizing the total weighted completion time of deteriorating jobs , 2002, Inf. Process. Lett..

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

[4]  Adam Janiak,et al.  Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..

[5]  T. C. Edwin Cheng,et al.  Due-date assignment and single machine scheduling with deteriorating jobs , 2004, J. Oper. Res. Soc..

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

[7]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[8]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

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

[10]  Stanisław Gawiejnowicz,et al.  NP-hard cases in scheduling deteriorating jobs on dedicated machines , 2001, J. Oper. Res. Soc..

[11]  Han Hoogeveen,et al.  Preemptive Scheduling with Rejection , 2000, ESA.

[12]  Gur Mosheiov,et al.  V-Shaped Policies for Scheduling Deteriorating Jobs , 1991, Oper. Res..

[13]  T. C. Edwin Cheng,et al.  Minimizing total completion time in a two-machine flow shop with deteriorating jobs , 2006, Appl. Math. Comput..

[14]  Ji-Bo Wang,et al.  Flow shop scheduling with deteriorating jobs under dominating machines , 2006 .

[15]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[16]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[17]  T. C. Edwin Cheng,et al.  Single machine scheduling with step-deteriorating processing times , 2001, Eur. J. Oper. Res..

[18]  Gerhard J. Woeginger,et al.  On-line scheduling of unit time jobs with rejection: minimizing the total completion time , 2002, Oper. Res. Lett..

[19]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

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

[21]  Gerhard J. Woeginger,et al.  When does a dynamic programming formulation guarantee the existence of an FPTAS? , 1999, SODA '99.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Steven S. Seiden.  Preemptive multiprocessor scheduling with rejection , 2001, Theor. Comput. Sci..

[24]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

[26]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[27]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .