Genetic algorithm for job shop scheduling problems with alternate routing

Mohammed F. Hussain, Sanjay B. Joshi

Research output: Contribution to journalConference article

13 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)2225-2230
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume3
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

Fingerprint

Genetic algorithms
Job shop scheduling

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Hardware and Architecture

Cite this

@article{5a09768bc6be48deb415e3ba34bf869b,
title = "Genetic algorithm for job shop scheduling problems with alternate routing",
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.",
author = "Hussain, {Mohammed F.} and Joshi, {Sanjay B.}",
year = "1998",
month = "12",
day = "1",
language = "English (US)",
volume = "3",
pages = "2225--2230",
journal = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
issn = "0884-3627",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Genetic algorithm for job shop scheduling problems with alternate routing. / Hussain, Mohammed F.; Joshi, Sanjay B.

In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Vol. 3, 01.12.1998, p. 2225-2230.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Genetic algorithm for job shop scheduling problems with alternate routing

AU - Hussain, Mohammed F.

AU - Joshi, Sanjay B.

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032313305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032313305&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0032313305

VL - 3

SP - 2225

EP - 2230

JO - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

JF - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

SN - 0884-3627

ER -