.png){kind=icon}
Return
Control of a batch-processing machine: a computational approach
.png){kind=icon}
PRE
AI
DOI：10.1080/002075498192355.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Batch processing machines, where a number of jobs are processed simultaneously as a batch, occur frequently in semiconductor manufacturing environments, particularly at diffusion in wafer fabrication and at burn-in in final test. In this paper we consider a batch-processing machine subject to uncertain (Poisson) job arrivals. Two different cases are studied: (1) the processing times of batches are independent and identically distributed (IID), corresponding to a diffusion tube; and (2) the processing time of each batch is the maximum of the processing times of its constituent jobs, where the processing times of jobs are no, modelling a burn-in oven. We develop computational procedures to minimize the expected long-run-average number of jobs in the system under a particular family of control policies. The control policies considered are threshold policies, where processing of a batch is initiated once a certain number of jobs have accumulated in the system. We present numerical examples of our methods and verify their accuracy using simulation.
Keywords:
SEMICONDUCTOR INDUSTRY
SCHEDULING MODELS
ALGORITHMS
TIME
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available
Cited Papers
No cited papers available