Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- 1 August 1992
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 40 (4) , 764-775
- https://doi.org/10.1287/opre.40.4.764
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
This publication has 0 references indexed in Scilit: