Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 55, Issue 8, Pages 830-835Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2601766
Keywords
genetic algorithms; scheduling; sequencing
Ask authors/readers for more resources
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. Journal of the Operational Research Society (2004).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available