Single-machine scheduling time-dependent jobs with resource-dependent ready times

In the paper resource constrained two single-machine scheduling problems with deteriorating jobs are considered. We model job deterioration as a function that is proportional to a linear function of time. It is assumed that the release time of a job is a positive strictly decreasing continuous function of the amount of consumed resource. We present polynomial solutions for the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, and the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit, respectively.

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

[2]  Ji-Bo Wang,et al.  Single machine scheduling with time-dependent deterioration and exponential learning effect , 2010, Comput. Ind. Eng..

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

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

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

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

[7]  G. Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning , 2009 .

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

[9]  J.-B. Wang.  Single machine scheduling with a time-dependent learning effect and deteriorating jobs , 2009, J. Oper. Res. Soc..

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

[11]  Ji-Bo Wang,et al.  Single machine scheduling problems with controllable processing times and total absolute differences penalties , 2005, Eur. J. Oper. Res..

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

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

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

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

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

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

[18]  J.-B. Wang,et al.  A note on scheduling problems with learning effect and deteriorating jobs , 2006, Int. J. Syst. Sci..

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

[20]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[21]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[22]  Zhao Chuan.  Single Machine Scheduling with Linear Processing Times , 2003 .

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