Title :
A genetic algorithm for job shop scheduling problems with alternate routing
Author :
Hussain, Mohammed F. ; Joshi, Sanjay B.
Author_Institution :
Pennsylvania State Univ., University Park, PA, USA
Abstract :
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 nonlinear program. A nonlinear constraint reduces the dimensional complexity of the best known formulation 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
Keywords :
computational complexity; genetic algorithms; nonlinear programming; production control; scheduling; alternate routing; dimensional complexity; job shop problem; job shop scheduling problems; nonlinear constraint; nonlinear program; second pass; start time; test problems; two pass genetic algorithm; Cost function; Degradation; Dispatching; Encoding; Genetic algorithms; Job shop scheduling; Metalworking machines; Processor scheduling; Routing; Testing;
Conference_Titel :
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-4778-1
DOI :
10.1109/ICSMC.1998.724986
