SciELO - Scientific Electronic Library Online

 
vol.7 número3Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabuBalanceamento e rebalanceamento de linhas de montagem operadas por grupos de trabalho autogerenciados índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Gestão & Produção

versão impressa ISSN 0104-530X

Resumo

BUZZO, Walther Rogério  e  MOCCELLIN, João Vitor. Production scheduling in flow shop systems by using a hybrid genetic algorithm-simulated annealing heuristic. Gest. Prod. [online]. 2000, vol.7, n.3, pp. 364-377. ISSN 0104-530X.  http://dx.doi.org/10.1590/S0104-530X2000000300012.

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.

Palavras-chave : production scheduling; flow shop sequencing; hybrid metaheuristics.

        · resumo em Português     · texto em Português     · pdf em Português