Please use this identifier to cite or link to this item: http://www.repositorio.ufc.br/handle/riufc/13114
Title in Portuguese: A Constructive hybrid genetic algorithm for the flowshop scheduling problem
Author: Silva, José Lassance de Castro
Soma, Nei Yoshihiro
Keywords: Algoritmos genéticos
Permutações
Issue Date: Sep-2008
Publisher: International Journal of Computer Science and Network Security
Citation: SILVA, J. L. C. ; SOMA, N. Y. (2008)
Abstract: This paper introduces a technique for solving the flowshop scheduling problem. The major idea is to partition the set of feasible solutions into regions in order to diversify the search that is used on a Genetic Algorithm variation. The population is formed by every distinct subject and it is carried out constructively in such a way that any iteration guarantees a diversification on the search for a feasible solution. The problem is a very well known NP-Hard problem and it imposes great challenges for determining its optimal solution in the practice. Computational experiments are reported for the literature instances and the obtained results are compared with other techniques.
Description: SILVA, J. L. C. ; SOMA, N. Y. A Constructive hybrid genetic algorithm for the flowshop scheduling problem. International Journal of Computer Science and Network Security, v. 8, n. 9, p. 219-23, set. 2008.
URI: http://www.repositorio.ufc.br/handle/riufc/13114
metadata.dc.type: Artigo de Periódico
Appears in Collections:GESLOG - Artigos publicados em revistas científicas

Files in This Item:
File Description SizeFormat 
2008_atr_jlcsilva.pdf80,52 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.