Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Chung-Yee Lee, Reha Uzsoy, Louis A. Martin-Vega
Operations Research · 1992 · Volume 40 · Issue 4
Abstract
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.
Keywords
dynamic programming/optimal control, applications: dynamic programming applications, production/scheduling, sequencing, deterministic: semiconductor manufacturing
Enable JavaScript for citation tools and additional paper interactions.