A note on single-machine scheduling with decreasing time-dependent job processing times

In this note we consider some single-machine scheduling problems with decreasing time-dependent job processing times. Decreasing time-dependent job processing times means that its processing time is a non-increasing function of its execution start time. We present polynomial solutions for the sum of squared completion times minimization problem, and the sum of earliness penalties minimization problem subject to no tardy jobs, respectively. We also study two resource constrained scheduling problems under the same decreasing time-dependent job processing times model and present algorithms to find their optimal solutions.

[1]  T.C.E. Cheng,et al.  Resource optimal control in some single-machine scheduling problems , 1994, IEEE Trans. Autom. Control..

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

[3]  Chuan-li Zhao,et al.  Single machine scheduling problems with deteriorating jobs , 2005, Appl. Math. Comput..

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

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

[6]  Adam Janiak,et al.  Time-optimal control in a single machine problem with resource constraints , 1986, Autom..

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

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

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

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

[11]  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..

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

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

[14]  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..

[15]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

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

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

[18]  Adam Janiak,et al.  Scheduling in a contaminated area: A model and polynomial algorithms , 2006, Eur. J. Oper. Res..

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

[20]  A. Janiak,et al.  Scheduling Deteriorating Jobs Dependent on Resources for the Makespan Minimization , 2001 .

[21]  Lixin Tang,et al.  Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration , 2009 .

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

[23]  Wen-Chiung Lee,et al.  Multi-machine scheduling with deteriorating jobs and scheduled maintenance , 2008 .

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