Please use this identifier to cite or link to this item:
|Title:||An algorithm for job scheduling in 2 - machine flow shop problem|
|Authors:||Odior, A. O.|
Oyawale, F. A.
|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 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.|
|Appears in Collections:||scholarly works|
Files in This Item:
|4.ui_art_odior_algorithm_2009 (38).pdf||1.6 MB||Adobe PDF|
|20.ui_art_odior_genetic_2010 (51).pdf||7 MB||Adobe PDF|
Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.