Please use this identifier to cite or link to this item: http://www.repositorio.ufc.br/handle/riufc/13114
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSilva, José Lassance de Castro-
dc.contributor.authorSoma, Nei Yoshihiro-
dc.date.accessioned2015-08-11T14:38:51Z-
dc.date.available2015-08-11T14:38:51Z-
dc.date.issued2008-09-
dc.identifier.citationSILVA, J. L. C. ; SOMA, N. Y. (2008)pt_BR
dc.identifier.urihttp://www.repositorio.ufc.br/handle/riufc/13114-
dc.descriptionSILVA, 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.pt_BR
dc.description.abstractThis 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.pt_BR
dc.language.isoenpt_BR
dc.publisherInternational Journal of Computer Science and Network Securitypt_BR
dc.subjectAlgoritmos genéticospt_BR
dc.subjectPermutaçõespt_BR
dc.titleA Constructive hybrid genetic algorithm for the flowshop scheduling problempt_BR
dc.typeArtigo de Periódicopt_BR
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.