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

并行机优化调度问题的新算法
引用本文:刘民,吴澄,杨英杰.并行机优化调度问题的新算法[J].清华大学学报(自然科学版),1999,39(5):geMap1.
作者姓名:刘民  吴澄  杨英杰
作者单位:清华大学,自动化系,北京,100084
基金项目:国家“八六三”高技术项目,教育部博士点基金
摘    要:将调度规则的简洁性与遗传算法的强大搜索能力相结合,提出一种能用于最小化拖期任务数并行机调度问题的基于遗传的新的调度算法,并用计算实例表明了该调度算法优于迄今最好的启发式算法,并能适用于大规模并行机调度问题,本算法计算量小,具有很强的鲁棒性。提出的基于遗传的调度算法不仅能用于生产调度领域,在大规模数值计算及计算机网络技术等方面都有很好的应用前景。

关 键 词:并行机  遗传算法  拖期任务  调度问题  调度规则
修稿时间:1998-05-20

New algorithm in parallel machine optimization scheduling problem
LIU Min,WU Cheng,YANG Yingjie.New algorithm in parallel machine optimization scheduling problem[J].Journal of Tsinghua University(Science and Technology),1999,39(5):geMap1.
Authors:LIU Min  WU Cheng  YANG Yingjie
Abstract:A kind of new scheduling algorithm was presented based on genetic one by means of combining the simplicity of scheduling rules with strong search ability of genetic algorithm in parallel machine scheduling problem of minimizing the number of tardy jobs, and the computational results show that the scheduling algorithm has advantage over so far best heuristic procedure and is fit for large scale parallel machine scheduling problem. The algorithm has a small quantity of calculation and strong robustness, a good promise in these application fields of both production scheduling and large scale digital computation, computer network technique and so on.
Keywords:parallel  machine  genetic algorithm  tardy job  scheduling problem  scheduling rule
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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