%0 Journal Article
%T A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem
%A Lee Hui Peng
%A Sutinah Salim
%J Matematika
%D 2006
%I Universiti Teknologi Malaysia
%X 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.
%K Job Shop Scheduling Problem
%K Genetic Algorithms
%K GT-GA.
%U http://www.fs.utm.my/matematika/images/stories/matematika/20062221.pdf