摘要
任务分配与调度问题是公认的NP问题,为了合理的对备份任务进行分配与调度,使得最短时间内完成备份任务,提出了基于遗传禁忌搜索的备份任务调度算法。重点研究了遗传算法和禁忌搜索算法,并针对二者的不足,提出将其两种算法混合,相互取长补短,仿真实验结果和实例应用表明,笔者提出的算法其搜索效率比单一的遗传算法具有较好的效果。
In general a task scheduling problem is a NP-hard problem. In order to arrange backup task reasonably to minimize the processing time,this paper proposes a task matching and scheduling algorithm based on genetic algorithm and tabu search algorithm. It then studies the genetic algorithm and the tabu search algorithm. The simulation experiment results and application examples show that the algorithm, comparing with the single generic algorithm ,has a great a result on the search efficiency.
出处
《河北科技大学学报》
CAS
2007年第4期269-271,共3页
Journal of Hebei University of Science and Technology
基金
黑龙江省自然科学基金资助项目(2005G3674-00)
关键词
遗传算法
禁忌搜索
备份
调度
任务分配与调度
genetic algorithm
tabu search
backup
scheduling
task matching and scheduling
