A genetic algorithm for the job shop problem

A genetic algorithm for the job shop problem

0.00 Avg rating0 Votes
Article ID: iaor1995957
Country: United Kingdom
Volume: 22
Issue: 1
Start Page Number: 15
End Page Number: 24
Publication Date: Jan 1995
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: branch and bound
Abstract:

In this paper the authors introduce a genetic algorithm whose peculiarities are the introduction of an encoding based on preference rules and an updating step which speeds up the evolutionary process. This method improves on the results gained previously with genetic algorithms and has shown itself to be competitive with other heuristics. The same algorithm has been applied to flow shop problems, revealing itself to be considerably more effective than branch and bound techniques.

Reviews

Required fields are marked *. Your email address will not be published.