Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops

This paper considers group scheduling problem in hybrid flexible flow shop with sequence-dependent setup times to minimize makespan. Group scheduling problem consists of two levels, namely scheduling of groups and jobs within each group. In order to solve problems with this context, two new metaheuristics based on simulated annealing (SA) and genetic algorithm (GA) are developed. A design procedure is developed to specify and adjust significant parameters for SA- and GA-based metaheuristics. The proposed procedure is based on the response surface methodology and two types of objective function are considered to develop multiple-objective decision making model. For comparing metaheuristics, makespan and elapsed time to obtain it are considered as two response variables representing effectiveness and efficiency of algorithms. Based on obtained results in the aspect of makespan, GA-based metaheuristic is recommended for solving group scheduling problems in hybrid flexible flow shop in all sizes and for elapsed time SA-based metaheuristic has better results.

[1]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[2]  Rasaratnam Logendran,et al.  Sequence-dependent group scheduling problems in flexible flow shops , 2006 .

[3]  R. Radharamanan.  A heuristic algorithm for group scheduling , 1986 .

[4]  Kenneth R. Baker,et al.  Scheduling the production of components at a common facility , 1988 .

[5]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[6]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[7]  S. F. Fatemi Ghomi,et al.  Scheduling job shop problems with sequence-dependent setup times , 2009 .

[8]  Rasaratnam Logendran,et al.  Group scheduling in flexible flow shops , 2005 .

[9]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[10]  J. C. Bean,et al.  A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS , 1999 .

[11]  Zbigniew Michalewicz,et al.  Parameter control in evolutionary algorithms , 1999, IEEE Trans. Evol. Comput..

[12]  Hamilton Emmons,et al.  Scheduling families of jobs with setup times , 1997 .

[13]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[16]  T. T. Narendran,et al.  Heuristics and sequence-dependent set-up jobs in flow line cells , 2003 .

[17]  Rasaratnam Logendran,et al.  Combined heuristics for bi-level group scheduling problems , 1995 .

[18]  Jatinder N. D. Gupta,et al.  Scheduling a flowline manufacturing cell with sequence dependent family setup times , 2000, Eur. J. Oper. Res..

[19]  Rasaratnam Logendran,et al.  Minimizing the makespan of a group scheduling problem: a new heuristic , 1991 .

[20]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[21]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

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

[23]  N. Nakamura,et al.  Group production scheduling for minimum total tardiness Part(I) , 1978 .

[24]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[25]  Jerry D. Allison.  Combining Petrov's heuristic and the CDS heuristic in group scheduling problems , 1990 .

[26]  Pius J. Egbelu,et al.  Job scheduling in a group technology environment for a single facility , 1985 .