Two-machine flow shop problem with effects of deterioration and learning

In this paper we consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the total completion time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and some lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed, which is shown by computational experiments to perform effectively and efficiently in obtaining near-optimal solutions.

[1]  T. C. Edwin Cheng,et al.  Three scheduling problems with deteriorating jobs to minimize the total completion time , 2002, Inf. Process. Lett..

[2]  Gur Mosheiov,et al.  Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..

[3]  Gur Mosheiov,et al.  Multi-Machine Scheduling With Linear Deterioration , 1998 .

[4]  T. P. Wright,et al.  Factors affecting the cost of airplanes , 1936 .

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

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

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

[8]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[9]  C. T. Ng,et al.  A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs , 2007 .

[10]  Gur Mosheiov,et al.  Scheduling with general job-dependent learning curves , 2003, Eur. J. Oper. Res..

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

[12]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

[13]  Chengen Wang,et al.  Efficient heuristic and optimal approaches for n/2/F/[sigma]Ci scheduling problems , 1996 .

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

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

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

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

[18]  J.-B. Wang,et al.  Flow-shop scheduling with a learning effect , 2005, J. Oper. Res. Soc..

[19]  Ji-Bo Wang,et al.  Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times , 2009, Comput. Math. Appl..

[20]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[21]  Zhi-Long Chen.  Parallel Machine Scheduling with Time Dependent Processing Times , 1996, Discret. Appl. Math..

[22]  Ji-Bo Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect , 2008, Comput. Ind. Eng..

[23]  Chin-Chia Wu,et al.  Minimizing total completion time in a two-machine flowshop with a learning effect , 2004 .

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

[25]  Ji-Bo Wang,et al.  Single-machine scheduling with general learning functions , 2008, Comput. Math. Appl..

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

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

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

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

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

[31]  Gur Mosheiov,et al.  Parallel machine scheduling with a learning effect , 2001, J. Oper. Res. Soc..

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

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

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

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

[36]  Gur Mosheiov,et al.  Scheduling problems with a learning effect , 2001, Eur. J. Oper. Res..

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

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

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