A genetic algorithm for flow shop scheduling problems |
| |
Authors: | O Etiler B Toklu M Atak J Wilson |
| |
Affiliation: | 1.?I?ECAM,Mersin,Turkey;2.Gazi University,Ankara,Turkey;3.Loughborough University,Loughborough,UK |
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |
|