摘要
对最小化完工时间的并行多机调度问题提出了一种遗传算法，并在问题形成、遗传算法编码、变异方法等方面作了研究，并用计算实例表明遗传算法能适用于大规模并行多机调度问题。
In this paper, a kind of genetic algorithm for minimizing the makespan in identical machine scheduling problem is presented, researches are made in these aspects such as problem formulation 、coding and mutating of genetic algorithm, and computational results show that the genetic algorithm is efficient and fit for large scale identical parallel machine scheduling problem.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1998年第1期14-17,103,共5页
Systems Engineering-Theory & Practice
基金
国家八六三高技术计划CIMS主题
关键词
遗传算法
组合优化
调度问题
并行多机调度
identical parallel machine, genetic algorithm, combinatorial optimization, scheduling problem
