Abstract
In this paper, a two pass genetic algorithm is used to solve the job shop scheduling problem with alternate routing. The first pass picks the alternatives using a genetic algorithm, the second pass provides the order and start time of jobs on the selected alternatives by solving a non linear program. A non linear constraint reduces the dimensional complexity of the best known for a job shop problem, and is used in the second pass of the algorithm. Preliminary results of this algorithm are encouraging and the algorithm has been able to solve small test problems to optimality.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2225-2230 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Volume | 3 |
| State | Published - Dec 1 1998 |
| Event | Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA Duration: Oct 11 1998 → Oct 14 1998 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Hardware and Architecture