期刊
COMPUTERS & OPERATIONS RESEARCH
卷 35, 期 10, 页码 3202-3212出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2007.02.014
关键词
job-shop scheduling; genetic algorithms; flexible manufacturing systems
In this paper, we present a genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP). The algorithm integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals. Computational result shows that the integration of more strategies in a genetic framework leads to better results, with respect to other genetic algorithms. Moreover, results are quite comparable to those obtained by the best-known algorithm, based on tabu search. These two results, together with the flexibility of genetic paradigm, prove that genetic algorithms are effective for solving FJSP. (C) 2007 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据