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!
|