[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v89y2013icp38-49.html
   My bibliography  Save this article

A hybrid method for performance analysis of G/G/m queueing networks

Author

Listed:
  • Rabta, Boualem
Abstract
Open queueing networks are useful for the performance analysis of numerous real systems. Since exact results exist only for a limited class of networks, decomposition methods have been extensively used for approximate analysis of general networks. This procedure is based on several approximation steps. Successive approximations made in this approach can lead to a considerable error in the output. In particular, there are no general accurate formulas for computing the mean waiting time and the inter-departure variance in general multiple-server queues. This causes the results from decomposition methods when applied to G/G/m queueing networks to be very approximative and to significantly deviate from actual performance values. We suggest substituting some approximate formulae by low-cost simulation estimates in order to obtain more accurate results when benefiting from the speed of an analytical method. Numerical experiments are presented to show that the proposed approach provides improved performance.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:89:y:2013:i:c:p:38-49
    DOI: 10.1016/j.matcom.2013.03.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475413000438
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2013.03.003?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. S. L. Albin, 1982. "On Poisson Approximations for Superposition Arrival Processes in Queues," Management Science, INFORMS, vol. 28(2), pages 126-137, February.
    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.
    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. 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.
    6. Susan L. Albin, 1984. "Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues," Operations Research, INFORMS, vol. 32(5), pages 1133-1162, October.
    7. Smith, J. MacGregor & Cruz, F.R.B. & van Woensel, T., 2010. "Topological network design of general, finite, multi-server queueing networks," European Journal of Operational Research, Elsevier, vol. 201(2), pages 427-441, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carlos Chaves & Abhijit Gosavi, 2022. "On general multi-server queues with non-poisson arrivals and medium traffic: a new approximation and a COVID-19 ventilator case study," Operational Research, Springer, vol. 22(5), pages 5205-5229, November.
    2. Eser Gemikonakli & Enver Ever & Glenford Mapp & Orhan Gemikonakli, 2017. "Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(4), pages 663-675, August.

    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. 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.
    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. 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.
    4. 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.
    5. 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.
    6. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. 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.
    8. 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.
    9. 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.
    10. Hill, R.M. & Seifbarghy, M. & Smith, D.K., 2007. "A two-echelon inventory model with lost sales," European Journal of Operational Research, Elsevier, vol. 181(2), pages 753-766, September.
    11. Sohner, Volkmar & Schneeweiss, Christoph, 1995. "Hierarchically integrated lot size optimization," European Journal of Operational Research, Elsevier, vol. 86(1), pages 73-90, October.
    12. 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.
    13. Girish, Muckai K. & Hu, Jian-Qiang, 2000. "Higher order approximations for the single server queue with splitting, merging and feedback," European Journal of Operational Research, Elsevier, vol. 124(3), pages 447-467, August.
    14. S. Rajagopalan, 2002. "Make to Order or Make to Stock: Model and Application," Management Science, INFORMS, vol. 48(2), pages 241-256, February.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. M. Rosário Moreira & Rui Alves, 2006. "Does Order Negotiation Improve The Job-Shop Workload Control?," FEP Working Papers 213, Universidade do Porto, Faculdade de Economia do Porto.
    20. 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.

    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:eee:matcom:v:89:y:2013:i:c:p:38-49. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.