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

最小化拖期任务数并行机调度问题的一种基于知识的遗传算法
引用本文:刘民,吴澄,戴元顺.最小化拖期任务数并行机调度问题的一种基于知识的遗传算法[J].电子学报,1999,27(9):130-132.
作者姓名:刘民  吴澄  戴元顺
作者单位:清华大学自动化系,北京,100084
基金项目:国家863 高技术项目,国家教委博士点基金
摘    要:本文研究了最小化拖期任务数并行调度问题,提出了一种基于知识的遗传算法,并在问题的描述、遗传算法编码、初始种群的产生办法、交叉方法、变异方法等方面作了研究,不同规模问题的数值计算结果表明了本文提出的基于知识的遗传算法优于目前为止最好的启发式算法和普通的遗传算法,并且能适应于较大规模的并行机调度问题。

关 键 词:并行机  遗传算法  组合优化  调度问题

Genetic Algorithm Method Based on Knowledge for Minimizing the Number of Tardy Jobs in Identical Parallel Machine Scheduling Problem
Liu Min,Wu Cheng,Dai Yuanshun.Genetic Algorithm Method Based on Knowledge for Minimizing the Number of Tardy Jobs in Identical Parallel Machine Scheduling Problem[J].Acta Electronica Sinica,1999,27(9):130-132.
Authors:Liu Min  Wu Cheng  Dai Yuanshun
Abstract:Identical parallel machine scheduling problem of minimizing the number of tardy jobs is studied,a genetic algorithm based on knowledge is proposed,and researches are made in these aspects such as problem formulation,coding,generation of initial population,crossover and mutating of genetic algorithm.Numerical computational results of different scale problem show that the genetic algorithm based on knowledge has advantage over so far best heuristic procedure and common genetic algorithm and is fit for larger scale identical parallel machine scheduling problem.
Keywords:Identical parallel machine  Genetic algorithm  Combinatorial optimization  Scheduling problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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