A genetic algorithm for flowshop sequencing

The basic concepts of Genetic Algorithms are described, following which a Genetic Algorithm is developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem. The performance of the algorithm is then compared with that of a naive Neighbourhood Search technique and with a proven Simulated Annealing algorithm on some carefully designed sets of instances of this problem.