Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
A genetic algorithm for flow shop scheduling problem
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 mini...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2010-04
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000njm a2000000a 4500 | ||
|---|---|---|---|
| 001 | oai:repository.ui.edu.ng:123456789/1829 | ||
| 042 | |a dc | ||
| 720 | |a Odior, A. O. |e author | ||
| 720 | |a Oyawale, F. A. |e author | ||
| 720 | |a Orsarh, E. S. |e author | ||
| 260 | |c 2010-04 | ||
| 520 | |a 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. | ||
| 024 | 8 | |a ui_art_odior_genetic_2010_04 | |
| 024 | 8 | |a http://ir.library.ui.edu.ng/handle/123456789/1829 | |
| 653 | |a :Johnson's hlgoritlim | ||
| 653 | |a Scheduling | ||
| 653 | |a Flow-Shop | ||
| 653 | |a Gcnctic Algorithm | ||
| 653 | |a Optimal SC~UCI~CC | ||
| 245 | 0 | 0 | |a A genetic algorithm for flow shop scheduling problem |