Approximating the performance of a batch service queue using the M/M^k/1 model

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Wu, Kan, Zwart, Bert, McGinnis, Leon F.
Other Authors: School of Mechanical and Aerospace Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/99573
http://hdl.handle.net/10220/17080
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-99573
record_format dspace
spelling sg-ntu-dr.10356-995732023-03-04T17:19:18Z Approximating the performance of a batch service queue using the M/M^k/1 model Wu, Kan Zwart, Bert McGinnis, Leon F. School of Mechanical and Aerospace Engineering DRNTU::Engineering::Manufacturing::Production management 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. Accepted version 2013-10-30T08:57:13Z 2019-12-06T20:09:08Z 2013-10-30T08:57:13Z 2019-12-06T20:09:08Z 2010 2010 Journal Article Wu, K., McGinnis, L. F., & Zwart, B. (2011). Approximating the Performance of a Batch Service Queue Using the M/M^k/1 Model. IEEE Transactions on Automation Science and Engineering, 8(1), 95-102. 1545-5955 https://hdl.handle.net/10356/99573 http://hdl.handle.net/10220/17080 10.1109/TASE.2010.2041927 en IEEE transactions on automation science and engineering © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TASE.2010.2041927]. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Manufacturing::Production management
spellingShingle DRNTU::Engineering::Manufacturing::Production management
Wu, Kan
Zwart, Bert
McGinnis, Leon F.
Approximating the performance of a batch service queue using the M/M^k/1 model
description 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.
author2 School of Mechanical and Aerospace Engineering
author_facet School of Mechanical and Aerospace Engineering
Wu, Kan
Zwart, Bert
McGinnis, Leon F.
format Article
author Wu, Kan
Zwart, Bert
McGinnis, Leon F.
author_sort Wu, Kan
title Approximating the performance of a batch service queue using the M/M^k/1 model
title_short Approximating the performance of a batch service queue using the M/M^k/1 model
title_full Approximating the performance of a batch service queue using the M/M^k/1 model
title_fullStr Approximating the performance of a batch service queue using the M/M^k/1 model
title_full_unstemmed Approximating the performance of a batch service queue using the M/M^k/1 model
title_sort approximating the performance of a batch service queue using the m/m^k/1 model
publishDate 2013
url https://hdl.handle.net/10356/99573
http://hdl.handle.net/10220/17080
_version_ 1759855551833964544