Please use this identifier to cite or link to this item:
|Title:||Approximating the performance of a batch service queue using the M/M^k/1 model||Authors:||Wu, Kan
McGinnis, Leon F.
|Keywords:||DRNTU::Engineering::Manufacturing::Production management||Issue Date:||2010||Source:||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.||Series/Report no.:||IEEE transactions on automation science and engineering||Abstract:||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.||URI:||https://hdl.handle.net/10356/99573
|ISSN:||1545-5955||DOI:||http://dx.doi.org/10.1109/TASE.2010.2041927||Rights:||© 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].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||MAE Journal Articles|
Files in This Item:
|Approximating the Performance of a Batch Service Queue Using the.pdf||451.09 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.