Referenced Items are not available for this document.
Approximating the Performance of a Batch Service Queue Using the 
Model
Approximating the Performance of a Batch Service Queue Using the
Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1-based approximate models. By carefully examining the existing models, the dependence between queueing time and wait-to-batch time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between queueing time and wait-to-batch time.
Published in:
Automation Science and Engineering, IEEE Transactions on
(Volume:8
,
Issue:
1
)
Date of Publication: Jan. 2011
- Page(s):
- 95 - 102
- ISSN :
- 1545-5955
- INSPEC Accession Number:
- 11727150
- Digital Object Identifier :
- 10.1109/TASE.2010.2041927
- Product Type:
- Journals & Magazines
- Date of Publication :
- 25 February 2010
- Date of Current Version :
- 30 December 2010
- Issue Date :
- Jan. 2011
- Sponsored by :
- IEEE Robotics and Automation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
