By Topic

A genetic algorithm for job shop scheduling problems with alternate routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. F. Hussain ; Pennsylvania State Univ., University Park, PA, USA ; S. B. Joshi

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

Published in:

Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:3 )

Date of Conference:

11-14 Oct 1998