A genetic algorithm for flowshop scheduling problems

A genetic algorithm for flowshop scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor2005918
Country: United Kingdom
Volume: 55
Issue: 8
Start Page Number: 830
End Page Number: 835
Publication Date: Aug 2004
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: production
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 flowshop 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.

Reviews

Required fields are marked *. Your email address will not be published.