Parallel machines scheduling with deteriorating and learning effects

In this paper parallel identical machines scheduling problems with deteriorating jobs and learning effects are considered. In this model, job processing times are defined by functions of their starting times and positions in the sequence. We concentrate on two goals separately, namely, minimizing a cost function containing total completion time and total absolute differences in completion times; minimizing a cost function containing total waiting time and total absolute differences in waiting times. We show that the problems remain polynomially solvable under the proposed model.

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

[2]  Pradeep Chintagunta.  Measuring the effects of new brand introduction on inter-brand strategic interaction , 1999, Eur. J. Oper. Res..

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

[4]  T. C. Edwin Cheng,et al.  Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan , 2007, Eur. J. Oper. Res..

[5]  Wen-Chiung Lee,et al.  A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems , 2004 .

[6]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

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

[8]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[9]  Dar-Li Yang,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2010, Comput. Ind. Eng..

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

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

[12]  Dar-Li Yang,et al.  A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects , 2011, J. Oper. Res. Soc..

[13]  Guoqing Wang,et al.  Single Machine Scheduling with Learning Effect Considerations , 2000, Ann. Oper. Res..

[14]  Xue Huang,et al.  Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties , 2011 .

[15]  David A. Nembhard,et al.  Task complexity effects on between-individual learning/forgetting variability , 2002 .

[16]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[17]  Uttarayan Bagchi,et al.  Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems , 1989, Oper. Res..

[18]  Jian-Bo Yang,et al.  Multicriteria evidential reasoning decision modelling and analysis—prioritizing voices of customer , 2011, J. Oper. Res. Soc..

[19]  T. C. Edwin Cheng,et al.  Scheduling Problems with the Effects of deterioration and Learning , 2007, Asia Pac. J. Oper. Res..

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

[21]  Ertan Güner,et al.  The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration , 2010, Expert Syst. Appl..

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

[23]  Gur Mosheiov,et al.  Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines , 2008, J. Oper. Res. Soc..