A comparison of messy GA and permutation based GA for job shop scheduling

Authors:
Pio Fenton;Paul Walsh
Affiliations:
Cork Institute of Technology, Cork, Ireland;Cork Institute of Technology, Cork, Ireland
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 1
Cited 1

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

Using messy genetic algorithms for solving the winner determination problem

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the results of a fair comparison between a messy GA and a permutation based simple GA as applied to a job shop scheduling system. An examination is made at a macro level in terms of performance and quality of schedules achieved and conclusions are drawn as to the superiority of messy GA or otherwise.