Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties

Abstract We consider a single-machine scheduling problem with linear decreasing deterioration in which the due dates are determined by the equal slack (SLK) method. By the linear decreasing deterioration, we mean that the job’s processing time is a decreasing function of its starting time. The objective is to minimize the total weighted earliness penalty subject to no tardy jobs. We prove that two special cases of the problem remain polynomially solvable. The first case is the problem with equally weighted monotonous penalty objective function and the other case is the problem with weighted linear penalty objective function.

[1]  T.C.E. Cheng,et al.  Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint , 2008, Comput. Oper. Res..

[2]  Xiangton Qi,et al.  Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method , 1998, Eur. J. Oper. Res..

[3]  Ji-Bo Wang,et al.  Single-machine scheduling with simple linear deterioration to minimize earliness penalties , 2010 .

[4]  Vitaly A. Strusevich,et al.  Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment , 1997, Comput. Oper. Res..

[5]  Ji-Bo Wang,et al.  A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties , 2010 .

[6]  Ji-Bo Wang,et al.  A due-date assignment problem with learning effect and deteriorating jobs , 2010 .

[7]  Pius J. Egbelu,et al.  Algorithm for minimizing weighted earliness penalty in single-machine problem , 2005, Eur. J. Oper. Res..

[8]  T. C. Edwin Cheng,et al.  Single machine due-date scheduling of jobs with decreasing start-time dependent processing times , 2005, Int. Trans. Oper. Res..

[9]  Stanislaw Gawiejnowicz,et al.  Scheduling deteriorating jobs subject to job or machine availability constraints , 2007, Eur. J. Oper. Res..

[10]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[11]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Tasks with Time-Dependent Execution Times , 1993, Inf. Process. Lett..

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

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

[14]  Xiao-Yuan Wang,et al.  Single machine common flow allowance scheduling with a rate-modifying activity , 2010, Comput. Ind. Eng..

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

[16]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[17]  Wen-Chiung Lee,et al.  Single-machine group-scheduling problems with deteriorating setup times and job-processing times , 2008 .

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

[19]  Ji-Bo Wang,et al.  Single machine scheduling with decreasing linear deterioration under precedence constraints , 2009, Comput. Math. Appl..

[20]  Ji-Bo Wang,et al.  Scheduling jobs under decreasing linear deterioration , 2005, Inf. Process. Lett..

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

[22]  Stanislaw Gawiejnowicz,et al.  Pareto and scalar bicriterion optimization in scheduling deteriorating jobs , 2006, Comput. Oper. Res..

[23]  Daniel Oron,et al.  Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times , 2008, Comput. Oper. Res..

[24]  Ji-Bo Wang,et al.  Two-machine flow shop scheduling with linear decreasing job deterioration , 2009, Comput. Ind. Eng..

[25]  Chia-Ming Chang,et al.  Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration , 2007 .

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

[27]  Ji-Bo Wang.  A note on single-machine scheduling with decreasing time-dependent job processing times , 2010 .

[28]  T. C. Edwin Cheng,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2008, Comput. Ind. Eng..

[29]  J.-B. Wang,et al.  Flow shop scheduling problems with deteriorating jobs under dominating machines , 2006, J. Oper. Res. Soc..

[30]  Ji-Bo Wang,et al.  Learning effect and deteriorating jobs in the single machine scheduling problems , 2009 .

[31]  Ji-Bo Wang,et al.  Flow shop scheduling problems with decreasing linear deterioration under dominant machines , 2007, Comput. Oper. Res..

[32]  Wen-Chiung Lee,et al.  Minimizing the total weighted completion time on a single machine under linear deterioration , 2007 .

[33]  Joseph Y.-T. Leung,et al.  Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times , 2008, Eur. J. Oper. Res..