Scheduling for IC sort and test

An integer programming formulation and the Lagrangian relaxation approach are used to solve a class of scheduling problems for integrated circuit (IC) sort and test. It provides a lower bound on the cost, which can be used to measure the suboptimality of feasible schedules. A numerical example is also given to illustrate the potential of the approach.<
>