Loading policies for a batch processing machine, i.e. a machine that can process more than one job at a time, when the arrival times of jobs to the machine are uncertain, are described. The motivation for the study is the structure of process flows and the predominance of batch processing systems in a semiconductor wafer fabrication facility. A two stage serial-batch system with the serial stage (e.g. photolithography) feeding the batch (e.g. furnace) is considered. Machines in the serial stage process one job at a time; further, these machines are subject to failure. A control limit policy for loading the batch machine is assumed, i.e. load if the queue length >or=Q, else wait until the number of jobs in queue is at least Q. The basic tradeoffs considered are delay (waiting too long) vs. capacity utilization (loading early with very few jobs). An average cost analysis is done and optimized to compute the critical number Q. In an extension to the basic model, the effect of due dates on the critical number is analyzed. Comparison with simulation results is very encouraging. >
[1]
Warren B. Powell,et al.
The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure
,
1986,
Oper. Res..
[2]
M. L. Chaudhry,et al.
A first course in bulk queues
,
1983
.
[3]
R. Leachman,et al.
Preliminary design and development of a corporate level production planning system for the semiconductor industry
,
1987,
Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[4]
C. R. Glassey,et al.
Dynamic batching heuristic for simultaneous processing
,
1991
.
[5]
R. Serfozo,et al.
Optimal control of batch service queues
,
1973,
Advances in Applied Probability.
[6]
Mauricio G. C. Resende,et al.
Closed-loop job release control for VLSI circuit manufacturing
,
1988
.
[7]
John W. Fowler,et al.
Real-time control of multiproduct bulk-service semiconductor manufacturing processes
,
1992
.