摘要
将调度规则的简洁性与遗传算法的强大搜索能力相结合，提出一种能用于最小化拖期任务数并行机调度问题的基于遗传的新的调度算法，并用计算实例表明了该调度算法优于迄今最好的启发式算法，并能适用于大规模并行机调度问题，本算法计算量小，具有很强的鲁棒性。提出的基于遗传的调度算法不仅能用于生产调度领域，在大规模数值计算及计算机网络技术等方面都有很好的应用前景。
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.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1999年第5期115-117,共3页
Journal of Tsinghua University(Science and Technology)
基金
国家"八六三"高技术项目
教育部博士点基金
关键词
并行机
遗传算法
调度问题
调度规则
组合优化
parallel machine
genetic algorithm
tardy job
scheduling problem
scheduling rule
