现代制造工程Issue(5)：50-53,105,5.
基于改进遗传算法的柔性作业车间调度
Scheduling for the flexible job-shop problem based on an improved genetic algorithm
摘要
Abstract
Examines the characteristic and development of the Flexible Job-shop Scheduling Problem (FJSP).An improved algorithm for the FJSP is proposed based on a basic genetic algorithm,a new chromosome representation is represented,and the chromosome is divided into two parts:Operation Assignment (OA) and Machine Selection (MS).The fitness function is built with weight,and the multi-objective optimization problem was transformed to linear optimization problems.According to the chromosome representation,the algorithm of initializing population is redesigned,different strategies for crossover and mutation operator are adopted.The experimental results have shown that the proposed algorithm is a viable and effective approach for the FJSP.关键词
柔性作业车间调度问题/遗传算法/交叉/变异Key words
Flexible Job-shop Scheduling Problem (FJSP) / genetic algorithm / crossover/ mutation分类
信息技术与安全科学引用本文复制引用
王进峰,阴国富,雷前召,范顺成..基于改进遗传算法的柔性作业车间调度[J].现代制造工程,2013,(5):50-53,105,5.基金项目
陕西省自然科学基金资助项目(2011JM8020) （2011JM8020）
中央高校基本科研业务费专项资金资助项目(10QG12) （10QG12）
