用遗传算法求解柔性作业车间调度问题  

Solving Scheduling Problem of Flexible Job in Shop by Genetic Algorithm

作　　者：陈皓[1] 陈铁英[1] 

机构地区：[1]华中科技大学自动控制系,湖北武汉430074

出　　处：《兵工自动化》2004年第4期14-15,共2页Ordnance Industry Automation

摘　　要：柔性作业车间调度,采用遗传基因编码算法对工序排序并分配给机床。设待加工件N个,工件i经过J道工序在M台机床加工完成,建立其数学模型。基因编码主串表示调度路径,副串表示调度次序。在主串中引入交叉算子,主副串以不同概率发生变异算子,并随机交换其中两位。仿真表明该算法求解完成所有工序的时间最短。The scheduling problem of flexible job in shop is solved with genetic algorithm, job queue is allocated to specified machines according to working procedure. Suppose N pieces of machined workpiece, J sequences of workpiece I are completed in M machines, mathematical model is established. Scheduling route is denoted by genic code host string, scheduling sequence is denoted by assistant string. Aceoss operator was adhibited in host string, and variation operators were brought by host string and assistant string as well as different probability, and exchange 2 bits operator among operators according to situation. Simulation result shows machining time is fewest about accomplished all the working procedure using the method.

关 键 词：柔性作业车间 遗传算法 作业车间调度 

分 类 号：TH165[机械工程—机械制造及自动化]