基于改进的遗传算法在车间作业调度中的应用与研究  

Application and Research on Job-Shop Scheduling Problem Based on the Improved Genetic Algorithm

作　　者：豆之敬[1] 赵卫[1] 刘凯[1] 

机构地区：[1]广东工业大学机电工程学院,广东广州510006

出　　处：《机电工程技术》2011年第3期62-64,83,共4页Mechanical & Electrical Engineering Technology

摘　　要：在车间作业调度中,如何合理安排工件在机器上的加工顺序是企业生产过程研究的关键问题,在分析作业调度的数学模型的基础上,以完工期最小为目标,设计了遗传算法,为克服传统遗传算法在求解过程中出现的早熟收敛现象,设计了一种独特的选择算子和交叉变异方式,通过实例验证了该算法的有效性。In the Job-Shop Scheduling problem,how to arrange the set of machine sequences for all jobs is the essential problem of enterprise produce process research.Through analyzing the mathematical model of JSP,this paper emphasis on designing the encoding scheme,as Job-Shop Scheduling problem with minimal makespan.In order to overcome traditional genetic algorithm in the solving process of premature convergence,design a kind of unique selection operators and crossover-mutation mode,through example shows the effectiveness of the proposed algorithm.

关 键 词：车间作业调度 遗传算法 编码 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]