A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem

Authors

  • Hui Peng Lee
  • Sutinah Salim

DOI:

https://doi.org/10.11113/matematika.v22.n.178

Abstract

Job Shop Scheduling Problem (JSSP) is one of the well-known hardest combinatorial optimization problems. The goal of this research is to study an efficient scheduling method based on Genetic Algorithm (GA) to address JSSP. A GA based on Giffler and Thompson (GT) algorithm known as GT-GA that utilizes the GT crossover is investigated. This algorithm is modified to produce better results than the existing algorithm by using Visual Prolog programming language. Keywords: Job Shop Scheduling Problem; Genetic Algorithms; GT-GA.

Downloads

Published

01-12-2006

Issue

Volume 22 (December 2006)

Section

Analysis and Algebra

License

Copyright of articles that appear in MATEMATIKA: MJIAM belongs exclusively to Penerbit UTM Press, Universiti Teknologi Malaysia. This copyright covers the rights to reproduce the article, including reprints, electronic reproductions or any other reproductions of similar nature.

How to Cite

A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem. (2006). MATEMATIKA, 22, 91-107. https://doi.org/10.11113/matematika.v22.n.178