IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v52y2005i5p399-408.html
   My bibliography  Save this article

Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

Author

Listed:
  • Sunkyo Kim

Abstract

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.

Suggested Citation

  • Sunkyo Kim, 2005. "Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 399-408, August.
    • Handle: RePEc:wly:navres:v:52:y:2005:i:5:p:399-408
    DOI: 10.1002/nav.20085
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20085
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20085?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ward Whitt, 1995. "Variability Functions for Parametric-Decomposition Approximations of Queueing Networks," Management Science, INFORMS, vol. 41(10), pages 1704-1715, October.
    2. Kim, Sunkyo, 2004. "The heavy-traffic bottleneck phenomenon under splitting and superposition," European Journal of Operational Research, Elsevier, vol. 157(3), pages 736-745, September.
    3. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rabta, Boualem, 2013. "A hybrid method for performance analysis of G/G/m queueing networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 89(C), pages 38-49.
    2. Sunkyo Kim, 2011. "Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks," Operations Research, INFORMS, vol. 59(2), pages 480-497, April.
    3. Wu, Kan & Zhao, Ning, 2015. "Dependence among single stations in series and its applications in productivity improvement," European Journal of Operational Research, Elsevier, vol. 247(1), pages 245-258.
    4. Van Nyen, Pieter L. M. & Van Ooijen, Henny P. G. & Bertrand, J.W.M.J. Will M., 2004. "Simulation results on the performance of Albin and Whitt's estimation method for waiting times in integrated production-inventory systems," International Journal of Production Economics, Elsevier, vol. 90(2), pages 237-249, July.
    5. Ward Whitt & Wei You, 2018. "Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues," Operations Research, INFORMS, vol. 66(1), pages 184-199, January.
    6. Kim, Sunkyo, 2004. "The heavy-traffic bottleneck phenomenon under splitting and superposition," European Journal of Operational Research, Elsevier, vol. 157(3), pages 736-745, September.
    7. Sohner, Volkmar & Schneeweiss, Christoph, 1995. "Hierarchically integrated lot size optimization," European Journal of Operational Research, Elsevier, vol. 86(1), pages 73-90, October.
    8. Pradhan, Salil & Damodaran, Purushothaman & Srihari, Krishnaswami, 2008. "Predicting performance measures for Markovian type of manufacturing systems with product failures," European Journal of Operational Research, Elsevier, vol. 184(2), pages 725-744, January.
    9. Kumar Satyam & Ananth Krishnamurthy, 2013. "Performance analysis of CONWIP systems with batch size constraints," Annals of Operations Research, Springer, vol. 209(1), pages 85-114, October.
    10. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    11. Dasu, Sriram, 1998. "Class dependent departure process from multiclass phase queues: Exact and approximate analyses," European Journal of Operational Research, Elsevier, vol. 108(2), pages 379-404, July.
    12. Yang, Feng, 2010. "Neural network metamodeling for cycle time-throughput profiles in manufacturing," European Journal of Operational Research, Elsevier, vol. 205(1), pages 172-185, August.
    13. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    14. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    15. Kavusturucu, Ayse & Gupta, Surendra M., 1999. "Manufacturing systems with machine vacations, arbitrary topology and finite buffers," International Journal of Production Economics, Elsevier, vol. 58(1), pages 1-15, January.
    16. Miltenburg, John & Sparling, David, 1996. "Managing and reducing total cycle time: models and analysis," International Journal of Production Economics, Elsevier, vol. 46(1), pages 89-108, December.
    17. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    18. Bitran, Gabriel R. & Morabito, Reinaldo., 1995. "Manufacturing system design : tradeoff curve analysis," Working papers 3805-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. Opher Baron & Antonis Economou & Athanasia Manou, 2018. "The state-dependent M / G / 1 queue with orbit," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 89-123, October.
    20. Liming Liu & Xiaoming Liu & David D. Yao, 2004. "Analysis and Optimization of a Multistage Inventory-Queue System," Management Science, INFORMS, vol. 50(3), pages 365-380, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:52:y:2005:i:5:p:399-408. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.