Performance evaluation of genetic algorithms for flowshop scheduling problems

The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine various genetic operators for the scheduling problem. Next we compare genetic algorithms with other search algorithms such as local search, taboo search and simulated annealing. By computer simulations, it is shown that genetic algorithms are a bit inferior to the others. Finally, we show two hybrid genetic algorithms: genetic local search and genetic simulated annealing. Their high performance is demonstrated by computer simulations.<
>