摘要
从车间生产调度的实际情况出发,针对最小化完工时间的并行多机调度问题,提出了一种优化遗传算法 充分考虑紧急任务的插入,通过提供一个记录设备当前负荷的数组,实现对任务的动态调度
According to a real situation of multi-machine scheduling problem, a genetic algorithm for minimizing the make-span in multi-machine scheduling problem is presented. To fulfill dynamic scheduling, the serting of urgent task is considered by supplying an array which records the machine loads. The result of computer simulation shows that the genetic algorithm is efficient and fits for large scale multi-machine scheduling problem.
出处
《大连铁道学院学报》
2004年第2期42-45,共4页
Journal of Dalian Railway Institute
基金
辽宁省科技攻关资助项目(20132188)
