Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
An algorithm for job scheduling in 2 - machine flow shop 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 machine problem based on minimum elapsed time. In scheduling the two machine flow shop problem F2||∑C1, one has to determine a schedule that...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2009
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|