Solving the Test Task Scheduling Problem with a Genetic Algorithm Based on the Scheme Choice Rule

摘要

The test task scheduling problem (TTSP) is an essential issue in automatic test system. In this paper, a new non-integrated algorithm called GASCR which combines a genetic algorithm with a new rule for scheme selection is adopted to find optimal solutions. GASCR is a hierarchal approach based on the characteristics of TTSP because the given problem can be decomposed into task sequence and scheme choice. GA with the non-Abelian (Nabel) crossover and stochastic tournament (ST) selector is used to find a proper task sequence. The problem-specific scheme choice rule addresses the scheme choice. To evaluate the proposed method, we apply it on several benchmarks and the results are compared with some well-known algorithms. The experimental results show the competitiveness of the GASCR for solving TTSP.