By Topic

Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tsung-Rian Chen ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; Tsu-Shuan Chang ; Cheng-Wu Chen ; Jen Kao

This paper presents a Lagrangian relaxation approach for the scheduling problem of an IC sort and test facility. In an integrated circuit (IC) manufacturing environment, a combination of tester, prober, and some hardware facilities is needed for wafer sort while a combination of tester, handler, and some other hardware facilities is needed for final test. To schedule both sorting and testing at the same time, the resource constraints on testers, probers, handlers and hardware have to be dealt with. This paper also extends the Lagrangian relaxation technique to solve a class of preemptive scheduling problems which particularly exist in an IC test floor environment. Numerical examples are given to illustrate the potential of the authors' approach. Comparisons of the authors' results with those obtained by some heuristic rules are also given

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:25 ,  Issue: 8 )