期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 55, 期 8, 页码 830-835出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2601766
关键词
genetic algorithms; scheduling; sequencing
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).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据