A genetic algorithm for flow shop scheduling problems

Abstract

Many scheduling problems are NP-hard problems. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we develop a genetic algorithm-based heuristic for the flow shop scheduling problem with makespan as the criterion. The performance of the algorithm is compared with the established NEH algorithm. Computational experience indicates that genetic algorithms can be good techniques for flowshop scheduling problems.

Keywords:

• genetic algorithms
• scheduling
• sequencing

Acknowledgements

The authors wish to express their thanks to the referees for the comments and suggestions to improve the earlier versions of the paper.