Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
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...
| Format: | Article |
|---|---|
| Published: |
2009
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|