Novel Ant Colony Algorithm for Parallel Test Task Scheduling
Rui Xia · Jisuanji fangzhen · 2008
The optimized parallel test task scheduling is a key problem to the parallel test. A novel ant colony algorithm was proposed to optimizing the parallel test task scheduling. With this algorithm, the task sequence with shortest total test time could be obtained. The mathematical model of the problem of parallel test task scheduling was established. The calculate formulae of heuristic information and probability of selecting were given. An approach of dynamic labeling to increase the pheromone difference between feasible solutions was adopted to avoid earliness of algorithm. Two examples were given. The practice application shows that this method is validated and can solve complex multidimensional dynamic combinatorial optimization problems.