Programação da produção em sistemas flow shop utilizando um método heurístico híbrido algoritmo genético-simulated annealing

This paper deals with the Permutation Flow Shop Scheduling problem. Many heuristic methods have been proposed for this scheduling problem. A class of such heuristics finds a good solution by improving initial sequences for the jobs through search procedures on the solution space as Genetic Algorithm (GA) and Simulated Annealing (SA). A promising approach for the problem is the formulation of hybrid metaheuristics by combining GA and SA techniques so that the consequent procedure is more effective than either pure GA or SA methods. In this paper we present a hybrid Genetic Algorithm-Simulated Annealing heuristic for the minimal makespan flow shop sequencing problem. In order to evaluate the effectiveness of the hybridization we compare the hybrid heuristic with both pure GA and SA heuristics. Results from computational experience are presented.

[1]  Mitsuo Gen,et al.  A method for maintenance scheduling using GA combined with SA , 1994 .

[2]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[3]  Rakesh Nagi,et al.  A hybrid GA - SA algorithm for Just-in-Time scheduling of multi-level assemblies , 1996 .

[4]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[5]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

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

[7]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[8]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

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

[10]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[11]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[12]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[13]  Yeong-Dae Kim,et al.  A systematic procedure for setting parameters in simulated annealing algorithms , 1998, Comput. Oper. Res..

[14]  Mitsuru Kuroda,et al.  Improvement on the computational efficiency of inverse queueing network analysis , 1994 .

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

[16]  M. Pirlot.  General local search methods , 1996 .

[17]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[18]  Maristela Oliveira dos Santos,et al.  An adaptive hybrid metaheuristic for permutation flowshop scheduling , 2000 .

[19]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

[20]  Marcelo Seido Nagano,et al.  Evaluating the performance of tabu search procedures for flow shop sequencing , 1998, J. Oper. Res. Soc..

[21]  Belarmino Adenso-Díaz,et al.  An SA/TS mixture algorithm for the scheduling tardiness problem , 1996 .

[22]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[23]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[25]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .