LU Xi, MO Ting-ting. Parallel Test Task Scheduling Based on Simulated Annealing Tabu Search Genetic Algorithm[J]. Microelectronics & Computer, 2015, 32(3): 146-150.
Citation: LU Xi, MO Ting-ting. Parallel Test Task Scheduling Based on Simulated Annealing Tabu Search Genetic Algorithm[J]. Microelectronics & Computer, 2015, 32(3): 146-150.

Parallel Test Task Scheduling Based on Simulated Annealing Tabu Search Genetic Algorithm

  • To solve the complex problem of parallel test task scheduling in the parallel automatic test system, a new static test task scheduling algorithm based on Stochastic Genetic Algorithm, Simulated Annealing Algorithm and Tabu Search Algorithm is proposed. The main ideas of Simulated Annealing Algorithm and Tabu Search Algorithm are applied to Stochastic Genetic Algorithm to avoid premature convergence problem of Genetic Algorithm, so that test task sequences with shortest total test time and highest parallel efficiency can be obtained. This new test task scheduling algorithm has low algorithm complexity, and it can get many efficient parallel test sequences in short time. It can also avoid local optimal solutions and gradually convergent to the feasible globally optimal solution. The experimental result shows that the new test task scheduling algorithm is feasible and ascendant.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return