Defect-oriented test scheduling
Authors:
- B. VinnakotaBVB. Vinnakota
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10930167,p. 433-438
Abstract
Test time can be reduced by ordering tests so as to fail defective units early in the test process. An ordering algorithm requires information on the ability of tests to detect defective units. We obtain it by applying all possible tests to a small subset of manufactured units and assume the information obtained from this sub-set is representative. We develop a simple polynomial-time heuristic which uses the information from the sample set to order tests. The heuristic, based on criteria that offer local optimality, offers globally optimal solutions in many cases. Optimal test ordering algorithms require execution time which is exponential in the number of tests applied. In our experiments, the heuristic results in a significant reduction in test time for manufactured digital and analog ICs.Keywords
This publication has 5 references indexed in Scilit:
- Scheduling semiconductor device test operations2002
- Scheduling for IC sort and test with preemptiveness via Lagrangian relaxationIEEE Transactions on Systems, Man, and Cybernetics, 1995
- Economic modeling of board test strategiesJournal of Electronic Testing, 1994
- Optimal scheduling of signature analysis for VLSI testingIEEE Transactions on Computers, 1991
- Optimal ordering of analog integrated circuit tests to minimize test time1991