Study on heuristics for the permutation flowshop with sequence dependent setup times

It is studied that several constructive heuristics for solving the sequence dependent setup time flowshop problem with the objective of minimizing makespan. Three priority rules imbedded in the heuristics are tested and a tie-breaking strategy is examined. The experimental results on benchmarks show that the priority rules are helpful to improve the performance, especially for the instances in which setup times are averagely smaller than the average processing time. The results also show that the setup times have a large effect on the performance of the heuristics.

[1]  Jv Simons.  Heuristics in flow shop scheduling with sequence dependent setup times , 1992 .

[2]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[3]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[4]  Jonathan F. Bard,et al.  Heuristics for the flow line problem with setup costs , 1998, Eur. J. Oper. Res..

[5]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[6]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[7]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

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

[9]  Jonathan F. Bard,et al.  The Flow Shop Scheduling Polyhedron with Setup Times , 2003, J. Comb. Optim..

[10]  J. Gupta.  FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES , 1986 .

[11]  Jonathan F. Bard,et al.  An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times , 1999, J. Heuristics.

[12]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[13]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[14]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[15]  Jatinder N. D. Gupta,et al.  A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times , 2006, J. Oper. Res. Soc..

[16]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

[17]  B. M. Khumawala,et al.  A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times , 1995 .