Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration

A real industrial production phenomenon, referred to as deteriorating jobs, has drawn increasing attention. However, most research on this issue considers only single-machine problems. Motivated by this limitation, this paper considers a simple linear deterioration model in a two-machine flowshop where the objective is to minimize the mean flow time. Several dominance rules and three lower bounds are proposed to speed up the search for an optimal solution, and several heuristic algorithms are provided to derive near-optimal solutions. In addition, a computational experiment is conducted to evaluate their performances. Results indicate that the algorithms perform well, and a combined heuristic algorithm is recommended for practitioners.

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

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

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

[4]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

[5]  Gur Mosheiov,et al.  Λ-Shaped Policies to Schedule Deteriorating Jobs , 1996 .

[6]  T. C. Edwin Cheng,et al.  Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine , 2003, Comput. Oper. Res..

[7]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

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

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

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

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

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

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  David Ben-Arieh,et al.  Annealing method for PCB assembly scheduling on two sequential machines , 1992 .

[15]  Wen-Chiung Lee,et al.  A two-machine flowshop maximum tardiness scheduling problem with a learning effect , 2006 .

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

[17]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

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

[19]  T. C. E. Cheng,et al.  The time dependent machine makespan problem is strongly NP-complete , 1999, Comput. Oper. Res..

[20]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[21]  Stanislaw Gawiejnowicz,et al.  Scheduling Jobs with Varying Processing Times , 1995, Inf. Process. Lett..

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

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

[24]  Yi-Chih Hsieh,et al.  Scheduling linearly deteriorating jobs on multiple machines , 1997 .

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