期刊
APPLIED SOFT COMPUTING
卷 12, 期 8, 页码 2237-2245出版社
ELSEVIER
DOI: 10.1016/j.asoc.2012.03.025
关键词
Fuzzy processing time; Flexible job shop scheduling; Genetic algorithm; Co-evolutionary
资金
- National Natural Science Foundation of China [70901064]
Fuzzy flexible job shop scheduling problem (FfJSP) is the combination of fuzzy scheduling and flexible scheduling in job shop environment, which is seldom investigated for its high complexity. We developed an effective co-evolutionary genetic algorithm (CGA) for the minimization of fuzzy makespan. In CGA, the chromosome of a novel representation consists of ordered operation list and machine assignment string, a new crossover operator and a modified tournament selection are proposed, and the population of job sequencing and the population of machine assignment independently evolve and cooperate for converging to the best solutions of the problem. CGA is finally applied and compared with other algorithms. Computational results show that CGA outperforms those algorithms compared. (C) 2012 Elsevier B. V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据