摘要
研究改进遗传算法解决作业车间调度问题,问题染色体的编码采用基于工序的编码。针对传统的调度类型的局限性,提出全主动调度及其基于工序编码的产生机制。为了克服传统遗传算法求解调度问题易于早熟收敛的缺点,设计基于优先工序交叉(Precedence operation crossover,POX)和改进子代产生模式的遗传算法。用改进的遗传算法求解传统调度问题、交货期调度问题和提前/拖期(Earliness/Tardiness,E/T)调度问题,研究半主动、主动和全主动三种不同的调度解码机制对遗传算法提供解质量的影响。
An improved genetic algorithm （GA） is presented for the job-shop scheduling problem, and the chromosome representation of the problem is based on the operation-based representation. In view of the limitation of the traditional types of scheduling, a new type of scheduling--full active schedule （FAS） and the schedule generation procedttre based on the operation-based representa- tion are presented. In order to avoid premature convergence of the conventional GA, the precedence operation crossover （POX） and approach of the generation alteration model are proposed for the improved GA. The improved GA is applied to solving the classical scheduling, due-dates scheduling and E/T scheduling problems, and the effectiveness of the active schedule, semi-active schedule and full active schedule decoding procedures for optimization algorithm is studied.
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2008年第10期24-31,共8页
Journal of Mechanical Engineering
基金
国家重点基础研究发展计划(973计划
2005CB724107)
国家高技术研究发展计划(863计划
2007AA04Z107
2007AA04Z190
2006AA04Z131)资助项目。
关键词
作业车间调度
遗传算法
交货期调度
E/T调度问题
Job-shop scheduling Genetic algorithm Due-dates scheduling Earliness/Tardiness scheduling problem
