IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v326y2025i1p141-156.html

Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach

Author

Listed:
  • Sherzer, Eliran

Abstract

Tandem queueing networks are widely used to model systems where services are provided in sequential stages. In this study, we assume that each station in the tandem system operates under a general renewal process. Additionally, we assume that the arrival process for the first station is governed by a general renewal process, which implies that arrivals at subsequent stations will likely deviate from a renewal pattern.

Suggested Citation

  • Sherzer, Eliran, 2025. "Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach," European Journal of Operational Research, Elsevier, vol. 326(1), pages 141-156.
    • Handle: RePEc:eee:ejores:v:326:y:2025:i:1:p:141-156
    DOI: 10.1016/j.ejor.2025.04.040
    as

    Download full text from publisher

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

    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. 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.
    3. Chaithanya Bandi & Dimitris Bertsimas & Nataly Youssef, 2015. "Robust Queueing Theory," Operations Research, INFORMS, vol. 63(3), pages 676-700, June.
    4. Weimin Dai & Jian-Qiang Hu, 2022. "Correlated queues with service times depending on inter-arrival times," Queueing Systems: Theory and Applications, Springer, vol. 100(1), pages 41-60, February.
    5. 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.
    6. A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    7. Qixin Wang & Jian-Qiang Hu, 2024. "Queues with correlated inter-arrival and service times," Queueing Systems: Theory and Applications, Springer, vol. 108(1), pages 1-30, October.
    8. 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.
    9. Opher Baron & Dmitry Krass & Arik Senderovich & Eliran Sherzer, 2024. "Supervised ML for Solving the GI / GI /1 Queue," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 766-786, May.
    10. Civelek, Ismail & Biller, Bahar & Scheller-Wolf, Alan, 2021. "Impact of dependence on single-server queueing systems," European Journal of Operational Research, Elsevier, vol. 290(3), pages 1031-1045.
    11. Sherzer, Eliran & Baron, Opher & Krass, Dmitry & Resheff, Yehezkel, 2025. "Approximating G(t)/GI/1 queues with deep learning," European Journal of Operational Research, Elsevier, vol. 322(3), pages 889-907.
    12. A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    13. Ruth Sagron & Uri Yechiali, 2024. "Inter-Departure Time Correlations in PH / G /1 Queues," Mathematics, MDPI, vol. 12(9), pages 1-23, April.
    14. Barış Tan & Siamak Khayyati, 2022. "Supervised learning-based approximation method for single-server open queueing networks with correlated interarrival and service times," International Journal of Production Research, Taylor & Francis Journals, vol. 60(22), pages 6822-6847, November.
    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. Spyros Garyfallos & Yunan Liu & Pere Barlet-Ros & Albert Cabellos-Aparicio, 2025. "NeuraliNQ: a neural network method for the transient performance analysis in non-Markovian Queues," Queueing Systems: Theory and Applications, Springer, vol. 109(4), pages 1-42, December.

    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. 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.
    2. Qixin Wang & Jian-Qiang Hu & Weimin Dai, 2026. "Queues with auto-correlated inter-arrival times," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-25, March.
    3. Ward Whitt & Wei You, 2022. "New decomposition approximations for queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 365-367, April.
    4. John Gunnar Carlsson & Xiaoshan Peng & Ilya O. Ryzhov, 2024. "Demand Equilibria in Spatial Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 26(6), pages 2305-2321, November.
    5. Ioannis Dimitriou, 2025. "On Markov-dependent reflected autoregressive processes and related models," Queueing Systems: Theory and Applications, Springer, vol. 109(3), pages 1-39, September.
    6. 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.
    7. Opher Baron & Dmitry Krass & Arik Senderovich & Mark van der Laan & Zhenghang Xu, 2026. "Queueing Causal Models: Comparative Analytics in Queueing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 28(2), pages 517-536, March.
    8. Chaithanya Bandi & Nikolaos Trichakis & Phebe Vayanos, 2019. "Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems," Management Science, INFORMS, vol. 65(1), pages 152-187, January.
    9. Spyros Garyfallos & Yunan Liu & Pere Barlet-Ros & Albert Cabellos-Aparicio, 2025. "NeuraliNQ: a neural network method for the transient performance analysis in non-Markovian Queues," Queueing Systems: Theory and Applications, Springer, vol. 109(4), pages 1-42, December.
    10. 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.
    11. Opher Baron & Dmitry Krass & Arik Senderovich & Eliran Sherzer, 2024. "Supervised ML for Solving the GI / GI /1 Queue," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 766-786, May.
    12. 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.
    13. 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.
    14. 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.
    15. Janusz SZPYTKO & Yorlandys SALGADO DUARTE, 2021. "Robust Simulation Method Of Complex Technical Transport Systems," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 16(2), pages 101-112, June.
    16. Shengyu Cao & Simai He & Zizhuo Wang & Yifan Feng, 2026. "Optimal Partition for a Multi-Type Queueing System," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 277-298, January.
    17. 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.
    18. Itai Gurvich & John J. Hasenbein, 2022. "Policy robustness in queueing networks," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 425-427, April.
    19. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    20. Sohner, Volkmar & Schneeweiss, Christoph, 1995. "Hierarchically integrated lot size optimization," European Journal of Operational Research, Elsevier, vol. 86(1), pages 73-90, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:ejores:v:326:y:2025:i:1:p:141-156. 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.elsevier.com/locate/eor .

    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.