A genetic algorithm for flow shop scheduling problem

Simple item page
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.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.identifier.otherui_art_odior_genetic_2010_04
dc.identifier.urihttp://ir.library.ui.edu.ng/handle/123456789/1829
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

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
19.ui_art_odior_genetic_2010_04(63).pdf
Size:
1.68 MB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

scholarly works