EFFICIENT ALGORITHMS FOR SCHEDULING SEMICONDUCTOR BURN-IN OPERATIONS
成果类型：
Article
署名作者：
LEE, CY; UZSOY, R; MARTINVEGA, LA
署名单位：
Purdue University System; Purdue University; National Science Foundation (NSF)
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.4.764
发表日期：
1992
页码：
764-775
关键词：
摘要：
In this paper, we study the problem of scheduling semiconductor bum-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.