An algorithm for job scheduling in 2 - machine flow shop problem

Simple item page
dc.contributor.authorOdior, A. O.
dc.contributor.authorOyawale, F. A.
dc.date.accessioned2018-10-10T12:46:48Z
dc.date.available2018-10-10T12:46:48Z
dc.date.issued2009
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 machine problem based on minimum elapsed time. In scheduling the two machine flow shop problem F2||∑C1, one has to determine a schedule that minimizes the sum of finishing times of an arbitrary number of jobs that need to be executed on two machines, such that each job must complete processing on machine 1 before starting on machine 2. We propose a heuristic for approximating the solution for the F2||∑C1 problem using a genetic algorithm.en_US
dc.identifier.otherThe Journal of the Nigerian Institution of Production Engineers 11, pp. 157-166
dc.identifier.otherui_art_odior_algorithm_2009
dc.identifier.urihttp://ir.library.ui.edu.ng/handle/123456789/1765
dc.language.isoenen_US
dc.subjectSchedulingen_US
dc.subjectFlow-Shopen_US
dc.subjectGenetic Algorithmen_US
dc.subjectOptimal Sequenceen_US
dc.titleAn algorithm for job scheduling in 2 - machine flow shop problemen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 2 of 2
Thumbnail Image
Name:
4.ui_art_odior_algorithm_2009 (38).pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
20.ui_art_odior_genetic_2010 (51).pdf
Size:
6.83 MB
Format:
Adobe Portable Document Format
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