Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Lee et al. (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: