摘要
带有截止期的作业调度问题是企业管理、操作系统中重要而又基本的问题之一。利用遗传算法解决了操作系统中单机、无资源约束 ,且每个作业可在等量时间内完成的作业调度问题。在系统地讨论了带有截止期的作业调度有关理论的基础上 ,设计并实现了该问题的一种新型算法———基因型算法。最后给出了算法的一些运行结果。实验仿真结果表明 ,该算法具有很强的鲁棒性。
It is well-known that the job-scheduling problem with deadline is a fundamental problem in management and operating systems. In this paper, we use GA (genetic algorithm) to give an algorithm for the job-scheduling problems in uni-processor and non-constrained resource in which each job can be finished in the same time. By analyzing some properties of job-scheduling problems, a new genetic algorithm is presented. The experimental results show that the algorithm is strongly robust.
出处
《系统工程与电子技术》
EI
CSCD
2000年第4期69-73,共5页
Systems Engineering and Electronics
基金
国家自然科学基金资助课题! (6960 1 0 0 3)
