Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times

This paper focuses on the problem of determining a permutation schedule for n jobs in an m-machine flow shop that operates in a sequence-dependent setup time (SDST) environment. Two constructive heuristic algorithms are developed with the minimisation of makespan as the objective. The first heuristic algorithm termed as setup ranking algorithm obtains the sequence using the setup times of jobs only. The second heuristic algorithm, fictitious job setup ranking algorithm (FJSRA), is developed using the concept of fictitious jobs. Pairs of jobs with minimum setup time between them constitute the fictitious jobs. Both these algorithms are compared with an existing constructive algorithm. For the purpose of experimentation, Taillard benchmark problems are used to develop SDST benchmark problems at eight different levels of sequence-dependent setup times. Graphical analysis, relative performance index analysis and statistical analysis are carried out on the results obtained for all the eight sets of benchmark problems. The analysis reveals that FJSRA emerges as the better algorithm for larger problems and for smaller problems with higher level of setup time. The results of statistical analysis are used to develop setup time dominance matrix for deciding upon the algorithm to be used for a particular size of problem.

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

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

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

[4]  M. Gholami,et al.  Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[5]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

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

[7]  Tamer Eren,et al.  A bicriteria m-machine flowshop scheduling with sequence-dependent setup times , 2010 .

[8]  Uday Kumar Chakraborty,et al.  An improved heuristic for permutation flowshop scheduling , 2007, Int. J. Inf. Commun. Technol..

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

[10]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[11]  Mostafa Zandieh,et al.  Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .

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

[13]  Soumen Ghosh,et al.  A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times , 1986 .

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

[15]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

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

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

[18]  S. Afshin Mansouri,et al.  Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times , 2009 .

[19]  Hark Hwang,et al.  Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times , 2001, Int. J. Syst. Sci..

[20]  R. Logendran,et al.  Makespan minimization of a flowshop sequence-dependent group scheduling problem , 2011 .

[21]  Adil Baykasoğlu,et al.  A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates , 1998 .

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

[23]  Fuh-Der Chou,et al.  A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan , 2011 .

[24]  Jonathan F. Bard,et al.  Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups , 1998, Comput. Oper. Res..

[25]  Chandrasekharan Rajendran,et al.  An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs , 2006 .

[26]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

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

[28]  Chandrasekharan Rajendran,et al.  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times , 2003, Eur. J. Oper. Res..

[29]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs , 1997 .

[30]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[31]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .