Parallel Test Task Scheduling with Constraints Based on Hybrid Particle Swarm Optimization and Taboo Search

Parallel test task scheduling is one of the key technologies used in parallel test. A hybrid Particle swarm optimization and Taboo search algorithm (PSO-TS) is proposed to solve parallel test task scheduling with constraints. The scheduling process is divided into two subproblems: task scheduling sequence with constraints and resource optimization. Under the view, the test resource scheduling problem can be solved after the task scheduling with constraints. This can improve the optimization rate of PSO-TS. What is more, a new inertia weight is proposed to enhance exploitation and exploration ability and a new constraint-handling mechanism is used to code during the particle updating for the test task scheduling problem. Simulation results show the suitability of the proposed algorithm in terms of feasibility and effectiveness.