特殊工艺约束下最小完工时间调度问题的新并行遗传算法  

A NEW PARALLEL GENETIC ALGORITHM FOR SCHEDULING PROBLEM OF MINIMIZING THE MAKESPAN WITH SPECIAL PROCESS CONSTRAINT

作　　者：何桂霞[1] 高家全[1] 赵端阳[1] 王雨顺[2] 

机构地区：[1]浙江工业大学之江学院,浙江杭州310024 [2]南京师范大学数学与计算机科学学院,江苏南京210097

出　　处：《计算机应用与软件》2008年第7期11-13,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(40405019)

摘　　要：针对在特殊工艺约束下非等同并行机最小完工时间调度问题,设计了一个基于向量组编码的新的遗传算法。此算法的编码方法简单,能有效地反映实际调度方案,并能保证交叉和变异后染色体满足约束条件,收敛速度快。同时为更好地适应调度实时性和解决大型企业此类问题的需要,在基于遗传算法自然并行性特点的基础上,实现了主从式控制网络模式下并行遗传算法。仿真结果表明,此算法是有效的,优于普通的遗传算法,具有较高的并行性。In order to solve the non-identical parallel machines scheduling problem for minimizing the makespan with special process constraint in textile enterprises, a new genetic algorithm based on vector group coding method is designed. The algorithm shows the following ad- vantages： its coding method is simple and can effectively reflect the actual scheduling policy, and it enables the chromosomes generated by crossover and mutation to satisfy the constraint conditions automatically, as well as converges quickly. Meanwhile, under the mode of master- slave control networks, parallel genetic algorithm is applied in order to adapt to real-time scheduling problems and these problems in larger scale enterprises. The emulation results show that the new algorithm is effective, superior than common genetic algorithms, and has much bet- ter parallel characteristics.

关 键 词：完工时间 并行遗传算法 特殊工艺约束 家纺企业 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] O242.23[自动化与计算机技术—控制科学与工程]