摘要
提出一种新的遗传算法(NGA)解决FJSP的完工时间最小化问题。采用新染色体表示和不同交叉操作和变异操作策略,依据基准数据集和测试数据验证了NGA算法。
A new genetic algorithm （NGA） is put forward to solve the minimized completion time for FJSP. We apply a new chromosome representation and adopt different crossover operations and mutation operation. The algorithm is verified based on both the benchmark and tested data sets.
作者
王丹
周连喆
WANG Dan ZHOU Lianzhe(School of Computer Science ＆ Engineering, Changchun University of Technology, Changchun 130012, China)
出处
《长春工业大学学报》
CAS
2017年第4期361-370,共10页
Journal of Changchun University of Technology
关键词
车间调度
遗传
交叉操作
变异操作
FJSP
genetic algorithm
crossover operator
mutation operator.
