Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes
Batch processors can concurrently process more than one job. In wafer fabrication, the processing time of a batch is independent of batch size, and only jobs from the same job family can be batched together. We consider a two-stage subsystem of a wafer fabrication facility (wafer fab), comprised of...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/101805 http://hdl.handle.net/10220/16902 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-101805 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1018052020-03-07T13:22:21Z Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes Tajan, John Benedict C. Sivakumar, Appa Iyer. Gershwin, Stanley B. School of Mechanical and Aerospace Engineering Singapore-MIT Alliance Programme Batch processors can concurrently process more than one job. In wafer fabrication, the processing time of a batch is independent of batch size, and only jobs from the same job family can be batched together. We consider a two-stage subsystem of a wafer fabrication facility (wafer fab), comprised of the diffusion furnace (a batch processor) and its upstream serial processor, with random job arrivals. We hypothesise that allowing the serial processor to anticipate the job family preference of the batch processor will reduce the overall cycle time of jobs passing through this system. To evaluate this hypothesis, we model the performance of the two-stage system under different system parameters and processor control policies as discrete state continuous time Markov chains. We characterise the system performance and show that the concept of constraining the production of the upstream processor according to the anticipated needs of the batch processor can reduce the mean cycle time of jobs being processed. We also perform simulation experiments to show that a simple heuristic based on this insight can translate to substantial cycle time reductions for systems with assumptions closer to those found in wafer fabs. 2013-10-25T03:23:01Z 2019-12-06T20:44:46Z 2013-10-25T03:23:01Z 2019-12-06T20:44:46Z 2012 2012 Journal Article Tajan, J. B. C., Sivakumar, A. I., & Gershwin, S. B. (2012). Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes. International Journal of Operational Research, 15(3), 260-289. https://hdl.handle.net/10356/101805 http://hdl.handle.net/10220/16902 10.1504/IJOR.2012.049482 en International journal of operational research |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
description |
Batch processors can concurrently process more than one job. In wafer fabrication, the processing time of a batch is independent of batch size, and only jobs from the same job family can be batched together. We consider a two-stage subsystem of a wafer fabrication facility (wafer fab), comprised of the diffusion furnace (a batch processor) and its upstream serial processor, with random job arrivals. We hypothesise that allowing the serial processor to anticipate the job family preference of the batch processor will reduce the overall cycle time of jobs passing through this system. To evaluate this hypothesis, we model the performance of the two-stage system under different system parameters and processor control policies as discrete state continuous time Markov chains. We characterise the system performance and show that the concept of constraining the production of the upstream processor according to the anticipated needs of the batch processor can reduce the mean cycle time of jobs being processed. We also perform simulation experiments to show that a simple heuristic based on this insight can translate to substantial cycle time reductions for systems with assumptions closer to those found in wafer fabs. |
author2 |
School of Mechanical and Aerospace Engineering |
author_facet |
School of Mechanical and Aerospace Engineering Tajan, John Benedict C. Sivakumar, Appa Iyer. Gershwin, Stanley B. |
format |
Article |
author |
Tajan, John Benedict C. Sivakumar, Appa Iyer. Gershwin, Stanley B. |
spellingShingle |
Tajan, John Benedict C. Sivakumar, Appa Iyer. Gershwin, Stanley B. Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
author_sort |
Tajan, John Benedict C. |
title |
Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
title_short |
Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
title_full |
Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
title_fullStr |
Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
title_full_unstemmed |
Evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
title_sort |
evaluating the performance of look-ahead policies for upstream serial processor with downstream batch processor serving incompatible job families and finite buffer sizes |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/101805 http://hdl.handle.net/10220/16902 |
_version_ |
1681042359270244352 |