机械科学与技术2011，Vol.30Issue(11)：1890-1894,5.
基于改进遗传算法求解柔性作业车间调度问题
Solving Flexible Job Shop Scheduling Problem Using Improved Genetic Algorithm
摘要
Abstract
The characteristics of the flexible job shop scheduling problem（FJSP） are analyzed,and an effective chromosome coding method is proposed to improve the genetic algorithm for solving the FJSP.In the genetic algorithm,each chromosome consists of machine chromosome and operation chromosome,denoting path selection and feasibility scheduling respectively,thus forming a scheduling scheme.Each gene of chromosome is encoded by a real number to enhance the efficiency of the encoding.The genetic operator thus designed does not generate illegal solutions when implementing crossover operation and mutation operation.The improved genetic algorithm is tested with an instance taken from the open literature and compared with the test results,which show that the improved genetic algorithm is effective for solving FJSP.关键词
遗传算法/柔性作业车间/染色体编码Key words
genetic algorithm/flexible job shop scheduling/chromosome encoding分类
管理科学引用本文复制引用
张国辉,石杨..基于改进遗传算法求解柔性作业车间调度问题[J].机械科学与技术,2011,30(11):1890-1894,5.基金项目
国家“863”高技术研究发展计划项目 （）
新世纪优秀人才支持计划（NCET-08-0232）资助 （）
