Please use this identifier to cite or link to this item:
http://ir.library.ui.edu.ng/handle/123456789/1829
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Odior, A. O. | - |
dc.contributor.author | Oyawale, F. A. | - |
dc.contributor.author | Orsarh, E. S. | - |
dc.date.accessioned | 2018-10-10T15:34:48Z | - |
dc.date.available | 2018-10-10T15:34:48Z | - |
dc.date.issued | 2010-04 | - |
dc.identifier.other | ui_art_odior_genetic_2010_04 | - |
dc.identifier.uri | http://ir.library.ui.edu.ng/handle/123456789/1829 | - |
dc.description.abstract | This 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.iso | en | en_US |
dc.subject | :Johnson's hlgoritlim | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Flow-Shop | en_US |
dc.subject | Gcnctic Algorithm | en_US |
dc.subject | Optimal SC~UCI~CC | en_US |
dc.title | A genetic algorithm for flow shop scheduling problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | scholarly works |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
19.ui_art_odior_genetic_2010_04(63).pdf | 1.72 MB | Adobe PDF | View/Open |
Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.