DESIGN OF A TESTING FIXTURE FOR PRINTED-CIRCUIT BOARDS

In this paper we discuss a functional testing problem in the printed circuit card assembly environment. The testing problem the design engineer faces is the following: Assign the maximum number of 100 mil (1 mil = 10(-3) inch) probes to an appropriately selected set of 50 mil pads in a way that avoids the creation of short circuits or other imposed engineering constraints. Once the above assignment problem is solved, a testing fixture that holds the 100 mil probes at their appropriate positions is constructed. We are addressing the design problem of the above mentioned testing fixture. An integer programming formulation of the problem is presented. A hierarchical decomposition scheme, which at a first level specifies the subset of 50 mil pads to be tested, and at a second level decides on the allocation of a 100 or 50 mil probes to the tested pads, exhibits a near optimal performance for most cases of practical interest. The first-level problem can be solved in polynomial time with a greedy procedure. The second-level problem is equivalent to node packing. For a special class of sparse graphs encountered in our application a simple greedy algorithm optimally solves the corresponding node packing problem.