By Topic

Application of a Lagrangian relaxation based scheduling algorithm to a semiconductor testing facility

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

2 Author(s)
C. A. Kaskavelis ; Dept. of Manuf. Eng., Boston Univ., MA, USA ; M. C. Caramanis

The objective of this study is the scheduling of the analog devices testing section of a production plant. The facility under study can be characterized as a high volume job shop, one of the most difficult production systems to schedule. Reentrant flow, variable daily capacity, and the need of multiple scarce resources for each operation, increase the difficulty of the scheduling problem. A Lagrangian relaxation based algorithm is proposed for scheduling the facility. The algorithm is efficient, flexible in handling the relevant modeling issues, and provides superior results when compared with simple dispatching rules which represent current industry practice

Published in:

Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on

Date of Conference:

10-12 Oct 1994