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.