Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1829
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOdior, A. O.-
dc.contributor.authorOyawale, F. A.-
dc.contributor.authorOrsarh, E. S.-
dc.date.accessioned2018-10-10T15:34:48Z-
dc.date.available2018-10-10T15:34:48Z-
dc.date.issued2010-04-
dc.identifier.otherui_art_odior_genetic_2010_04-
dc.identifier.urihttp://ir.library.ui.edu.ng/handle/123456789/1829-
dc.description.abstractThis paper considers the problem of scheduling in flow-shop by Johnson's Algorithm method and Genetic Algorithm method to find an optimal sequence for n jobs m-machine based on minimum elapsed time. It has been shown that the method for finding an optimal sequence for n jobs, m-machine based on minimum make span using genetic algorithm provides a better result.en_US
dc.language.isoenen_US
dc.subject:Johnson's hlgoritlimen_US
dc.subjectSchedulingen_US
dc.subjectFlow-Shopen_US
dc.subjectGcnctic Algorithmen_US
dc.subjectOptimal SC~UCI~CCen_US
dc.titleA genetic algorithm for flow shop scheduling problemen_US
dc.typeArticleen_US
Appears in Collections:scholarly works

Files in This Item:
File Description SizeFormat 
19.ui_art_odior_genetic_2010_04(63).pdf1.72 MBAdobe PDFThumbnail
View/Open


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