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

并行多机调度问题的一种基于组合规则的遗传算法
引用本文:刘民,吴澄,杨英杰.并行多机调度问题的一种基于组合规则的遗传算法[J].电子学报,2000,28(5):52-54.
作者姓名:刘民  吴澄  杨英杰
作者单位:清华大学自动化系,北京 100084
基金项目:国家八六三高技术计划自动化领域CIMS主题基金资助课题,国家教委博士点基金
摘    要:本文对最小化完工时间并行多机调度问题提出了一种基于组合规则的遗传算法.用遗传算法来优化调度策略,使得在不同的调度阶段,可采用不同的调度规则以提高算法性能,并用计算实例表明了该遗传算法优于基于机器编码的模拟退火算法和遗传算法,并能适用于大规模并行多机调度问题,算法计算量小,鲁棒性强.

关 键 词:并行多机  遗传算法  组合规则  完工时间  调度问题  
收稿时间:1998-07-08

Genetic Algorithm Method Based on Combinatorial Rules in Identaical Parallel Machine Scheduling Problem
LIU Min,WU Cheng,YANG Ying-jie.Genetic Algorithm Method Based on Combinatorial Rules in Identaical Parallel Machine Scheduling Problem[J].Acta Electronica Sinica,2000,28(5):52-54.
Authors:LIU Min  WU Cheng  YANG Ying-jie
Affiliation:Department of Automation,Tsinghua University,Beijing 100084,China
Abstract:A kind of genetic algorithm based on combinatorial rules is presented for solving the identical machine scheduling problem of minimizing the makespan,that is,scheduling policy is optimized by genetic algorithm,and it allows that different scheduling rule to be adopted at different scheduling stage to improve the performance of the algorithm.Computational results show that the genetic algorithm has advantage over simulated annealing and genetic algorithms based on machine code and is fit for large scale identical parallel machine scheduling problem,and that the algorithm has small quantity of calculation and strong robustness.
Keywords:identical parallel machine  genetic algorithm  combinatorial rule  makespan  scheduling problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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