EFFICIENT ALGORITHMS FOR SCHEDULING SEMICONDUCTOR BURN-IN OPERATIONS
EFFICIENT ALGORITHMS FOR SCHEDULING SEMICONDUCTOR BURN-IN OPERATIONS
复制标题
DOI：
10.1287/opre.40.4.764
复制
发表时间：
1992-07-01
影响因子：
2.7
通讯作者：
MARTINVEGA, LA
中科院分区：
文献类型：
--
作者：
LEE, CY;UZSOY, R;MARTINVEGA, LA
在本文中，我们研究了半导体老化操作的调度问题，其中老化炉被建模为批处理机器。批处理机是指可以同时处理最多 B 个作业的机器。一个批次的处理时间等于该批次中所有作业中最大的处理时间。我们提出了基于动态编程的高效算法，用于最小化单个批处理机器上的许多不同性能度量。我们还提出了有关并行相同批处理机的许多问题的启发式方法，并提供了最坏情况的错误界限。
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.