首页 | 本学科首页   官方微博 | 高级检索  
     

特殊工艺约束下最小完工时间调度问题的新并行遗传算法
引用本文:何桂霞,高家全,赵端阳,王雨顺. 特殊工艺约束下最小完工时间调度问题的新并行遗传算法[J]. 计算机应用与软件, 2008, 25(7)
作者姓名:何桂霞  高家全  赵端阳  王雨顺
作者单位:浙江工业大学之江学院,浙江,杭州,310024;南京师范大学数学与计算机科学学院,江苏,南京,210097
基金项目:国家自然科学基金项目(40405019)
摘    要:针对在特殊工艺约束下非等同并行机最小完工时间调度问题,设计了一个基于向量组编码的新的遗传算法。此算法的编码方法简单,能有效地反映实际调度方案,并能保证交叉和变异后染色体满足约束条件,收敛速度快。同时为更好地适应调度实时性和解决大型企业此类问题的需要,在基于遗传算法自然并行性特点的基础上,实现了主从式控制网络模式下并行遗传算法。仿真结果表明,此算法是有效的,优于普通的遗传算法,具有较高的并行性。

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

A NEW PARALLEL GENETIC ALGORITHM FOR SCHEDULING PROBLEM OF MINIMIZING THE MAKESPAN WITH SPECIAL PROCESS CONSTRAINT
He Guixia,Gao Jiaquan,Zhao Duanyang,Wang Yushun. A NEW PARALLEL GENETIC ALGORITHM FOR SCHEDULING PROBLEM OF MINIMIZING THE MAKESPAN WITH SPECIAL PROCESS CONSTRAINT[J]. Computer Applications and Software, 2008, 25(7)
Authors:He Guixia  Gao Jiaquan  Zhao Duanyang  Wang Yushun
Affiliation:He Guixia1 Gao Jiaquan1 Zhao Duanyang1 Wang Yushun21(Zhijiang College,Zhejiang University of Technology,Hangzhou 310024,Zhejiang,China)2(School of Mathematics , Computer Science,Nanjing Normal University,Nanjing 210097,Jiangsu,China)
Abstract: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 advantages: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.Meanwhi...
Keywords:Makespan Parallel genetic algorithm Special process constraint Textile enterprises  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号