航空学报 > 2011, Vol. 32 Issue (9): 1669-1677   doi: CNKI:11-1929/V.20110324.1152.005

基于图禁忌的并行测试任务调度算法

路辉, 陈晓, 刘欣, 邓小乐   

  1. 北京航空航天大学 电子信息与工程学院, 北京 100191
  • 收稿日期:2010-11-23 修回日期:2010-12-27 出版日期:2011-09-25 发布日期:2011-09-16
  • 通讯作者: 路辉(1977-) 女,博士后,副教授。主要研究方向:自动测试系统、故障诊断。 Tel: 010-82316487 E-mail: mluhui@163.com E-mail:mluhui@163.com
  • 基金资助:

    "十一五"国防预研项目 (B0520060455)

A Graph Tabu Algorithm for Parallel Test Task Scheduling

LU Hui, CHEN Xiao, LIU Xin, DENG Xiaole   

  1. School of Electronics and Information Engineering, Beihang University, Beijing 100191, China
  • Received:2010-11-23 Revised:2010-12-27 Online:2011-09-25 Published:2011-09-16

摘要: 现有算法处理强约束关系的并行测试任务调度问题具有运算时间长、寻优概率低、收敛性差等缺陷,针对这些问题提出了一种基于图禁忌的调度算法。该算法从测试任务间的约束关系入手,利用图论建立测试任务间的关系图,并结合禁忌算法实现并行测试任务的多目标优化调度。算法中将强约束关系的测试任务调度问题与无约束关系的资源配置问题进行分离,提高了算法的寻优速度。通过仿真实例证明了算法的有效性,与现有并行测试任务调度算法相比,运算时间减少96%、寻优率提高了36.5%,并且具有更好的收敛性。

关键词: 图论, 禁忌搜索, 并行测试, 任务调度, 强约束关系

Abstract: This paper presents a graph tabu approach to deal with problems existing in present parallel test task scheduling approaches, such as long computation time, low probability optimization rate, premature convergence to local optima, etc. The approach in this paper starts with strong constraints among parallel test tasks, then uses the graph theory to establish a diagram of test tasks, and finally realizes multi-objective optimization of parallel test task scheduling by combining with a tabu search algorithm. This approach makes a separation between strong constraint test task scheduling and no constraint test resource scheduling, which improves the optimization speed. The experimental results show that the approach is feasible. Compared with the existing approaches, the proposed approach realizes a 96% reduction of computing time, 36.5% increment of the optimization rate, and better convergence.

Key words: graph theory, tabu search, parallel test, task scheduling, strong constraint

中图分类号: