You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Chung-Yee Lee, Reha Uzsoy and Louis A. Martin-Vega
Vol. 40, No. 4 (Jul. - Aug., 1992), pp. 764-775
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171006
Page Count: 12
Preview not available
In this paper, we study the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. A batch processing machine is one that can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. We present efficient dynamic programming-based algorithms for minimizing a number of different performance measures on a single batch processing machine. We also present heuristics for a number of problems concerning parallel identical batch processing machines and we provide worst case error bounds.
Operations Research © 1992 INFORMS