On three-machine flow shop scheduling with deteriorating jobs

In this paper, we consider a three-machine permutation flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence that minimizes makespan. This problem is well known NP-hard. Optimal schedules are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. Moreover, a heuristic algorithm is proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational experiments on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm. The analysis shows that the proposed heuristic algorithm performs effectively and efficiently.

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

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

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

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

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

[6]  Talel Ladhari,et al.  Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop , 2009 .

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

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

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[11]  Jatinder N. D. Gupta,et al.  Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..

[12]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[13]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .

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

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

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

[17]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1999, Math. Oper. Res..

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

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

[20]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[21]  Chuanli Zhao,et al.  Scheduling deteriorating jobs under disruption , 2010 .

[22]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

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

[24]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

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

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

[27]  Linyan Sun,et al.  Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times , 2009 .

[28]  Chin-Chia Wu,et al.  A two-machine flowshop scheduling problem with deteriorating jobs and blocking , 2010 .

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

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

[31]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

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