Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

Abstract In this paper, we address a two-machine 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 total weighted completion time. 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. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational analysis on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm.

[1]  Bo Jiang,et al.  Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time , 2006, Appl. Math. Comput..

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

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

[4]  Ji-Bo Wang.  Erratum to: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines [Appl. Math. Computation 184 (2007) 945-949] , 2008, Appl. Math. Comput..

[5]  Ji-Bo Wang,et al.  A due-date assignment problem with learning effect and deteriorating jobs , 2010 .

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

[7]  T.C.E. Cheng,et al.  Scheduling problems with deteriorating jobs and learning effects including proportional setup times , 2010, Comput. Ind. Eng..

[8]  Shijie Sun,et al.  A note on flow shop scheduling problems with a learning effect on no-idle dominant machines , 2007, Appl. Math. Comput..

[9]  Wen-Chiung Lee,et al.  Single-machine group scheduling problems with deterioration consideration , 2008, Comput. Oper. Res..

[10]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling with simple linear deterioration to minimize total completion time , 2008, Eur. J. Oper. Res..

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

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

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

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

[15]  Suh-Jenq Yang,et al.  Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration , 2010, Appl. Math. Comput..

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

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

[18]  T. C. Edwin Cheng,et al.  A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs , 2010, Comput. Oper. Res..

[19]  Dar-Li Yang,et al.  Parallel-machine scheduling with time dependent processing times , 2008, Theor. Comput. Sci..

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

[21]  T. C. Edwin Cheng,et al.  Due-date assignment and parallel-machine scheduling with deteriorating jobs , 2007, J. Oper. Res. Soc..

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

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

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

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

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

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

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

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

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

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

[32]  Bertrand M. T. Lin,et al.  Scheduling time-dependent jobs under mixed deterioration , 2010, Appl. Math. Comput..

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

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

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

[36]  Rafael Moras,et al.  Makespan minimization in machine dominated flowshop , 2010, Appl. Math. Comput..

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

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

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

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