Genetic algorithm for job shop scheduling problems with alternate routing

Mohammed F. Hussain, Sanjay B. Joshi

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations


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 languageEnglish (US)
Pages (from-to)2225-2230
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
StatePublished - Dec 1 1998
EventProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA
Duration: Oct 11 1998Oct 14 1998

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Hardware and Architecture


Dive into the research topics of 'Genetic algorithm for job shop scheduling problems with alternate routing'. Together they form a unique fingerprint.

Cite this