Control of a batch-processing machine: a computational approach
Control of a batch-processing machine: a computational approach
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 IID, 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.
3167-3181
Avramidis, Athanassios.N.
d6c4b6b6-c0cf-4ed1-bbe1-a539937e4001
Healy, K.J.
9ac4bf85-8441-4cda-8560-e084209693cc
Uzsoy, R.
2e587273-41d3-4964-909a-b414f0fbbabf
1 November 1998
Avramidis, Athanassios.N.
d6c4b6b6-c0cf-4ed1-bbe1-a539937e4001
Healy, K.J.
9ac4bf85-8441-4cda-8560-e084209693cc
Uzsoy, R.
2e587273-41d3-4964-909a-b414f0fbbabf
Avramidis, Athanassios.N., Healy, K.J. and Uzsoy, R.
(1998)
Control of a batch-processing machine: a computational approach.
International Journal of Production Research, 36 (11), .
Abstract
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 IID, 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.
This record has no associated files available for download.
More information
Published date: 1 November 1998
Organisations:
Mathematical Sciences
Identifiers
Local EPrints ID: 336782
URI: http://eprints.soton.ac.uk/id/eprint/336782
ISSN: 0020-7343
PURE UUID: 1f12d7e9-e05c-4f13-870d-eb86eca6af1f
Catalogue record
Date deposited: 13 Apr 2012 08:36
Last modified: 09 Jan 2022 03:27
Export record
Contributors
Author:
K.J. Healy
Author:
R. Uzsoy
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics