{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T20:08:53Z","timestamp":1779134933125,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00383-z","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T11:02:16Z","timestamp":1729162936000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Analysis of Semi-open Queueing Network with Correlated Arrival Process and Multi-server Nodes"],"prefix":"10.1007","volume":"5","author":[{"given":"Sergey","family":"Dudin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Dudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosanna","family":"Manzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Rarit\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"383_CR1","volume-title":"Queueing networks and Markov chains: modeling and performance evaluation with computer science applications","year":"2006","unstructured":"Bolch G, Greiner S, De Meer H, Trivedi KS (eds) (2006) Queueing networks and Markov chains: modeling and performance evaluation with computer science applications. John Wiley & Sons, New York"},{"key":"383_CR2","first-page":"377","volume":"1769","author":"S Balsamo","year":"2000","unstructured":"Balsamo S (2000) Product form queueing networks. Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics) 1769:377\u2013401","journal-title":"Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics)"},{"key":"383_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/356733.356735","volume":"10","author":"PJ Denning","year":"1978","unstructured":"Denning PJ, Buzen PJ (1978) The operational analysis of queueing network models. Comput Survey 10:225\u2013261","journal-title":"Comput Survey"},{"key":"383_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0278-6125(99)80033-8","volume":"18","author":"MK Govil","year":"1999","unstructured":"Govil MK, Fu MC (1999) Queueing theory in manufacturing: a survey. J Manuf Syst 18:214\u2013240","journal-title":"J Manuf Syst"},{"key":"383_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F Baskett","year":"1985","unstructured":"Baskett F, Chandy KM, Muntz RR, Palacios G (1985) Open, closed, and mixed networks of queues with different classes of customers. J ACM 22:248\u2013260","journal-title":"J ACM"},{"key":"383_CR6","volume-title":"Reversibility and stochastic networks","year":"1979","unstructured":"Kelly FP (ed) (1979) Reversibility and stochastic networks. Wiley, New York"},{"issue":"4","key":"383_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1108\/MABR-01-2023-0009","volume":"8","author":"P Legato","year":"2023","unstructured":"Legato P, Mazza RM (2023) Queueing networks for supporting container storage and retrieval. Marit Bus Rev 8(4):301\u2013317","journal-title":"Marit Bus Rev"},{"issue":"6","key":"383_CR8","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1080\/00207543.2015.1056316","volume":"54","author":"D Roy","year":"2016","unstructured":"Roy D (2016) Semi-open queuing networks: a review of stochastic models, solution methods and new research areas. Int J Product Res 54(6):1735\u20131752","journal-title":"Int J Product Res"},{"key":"383_CR9","doi-asserted-by":"crossref","unstructured":"Xie H, Chaussalet TJ, Rees M (2007) A semi-open queueing network approach to the analysis of patient flow in healthcare systems. In: Proceedings of the 20th IEEE international symposium on computer-based medical systems. IEEE CBMS 2007, Maribor, Slovenia, 20-22 June 2007. USA IEEE, Los Alamitos, pp 719\u2013724","DOI":"10.1109\/CBMS.2007.12"},{"issue":"2","key":"383_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.1080.0627","volume":"57","author":"J Jia","year":"2009","unstructured":"Jia J, Heragu S (2009) Solving semi-open queuing networks. Oper Res 57(2):391\u2013401","journal-title":"Oper Res"},{"key":"383_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cie.2013.12.002","volume":"68","author":"B Ekren","year":"2014","unstructured":"Ekren B, Heragu S, Krishnamurthy A, Malmborg C (2014) Matrix-geometric solution for semi-open queuing network model of autonomous vehicle storage and retrieval system. Comput Ind Eng 68:78\u201386","journal-title":"Comput Ind Eng"},{"key":"383_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.peva.2017.12.005","volume":"120","author":"J Kim","year":"2018","unstructured":"Kim J, Dudin A, Dudin S, Kim C (2018) Analysis of a semi-open queueing network with Markovian arrival process. Perform Eval 120:1\u20139","journal-title":"Perform Eval"},{"issue":"22","key":"383_CR13","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00291-021-00662-9","volume":"44","author":"S Otten","year":"2022","unstructured":"Otten S, Krenzler R, Xie L, Daduna H, Kruse K (2022) Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems. OR Spectrum 44(22):603\u2013648","journal-title":"OR Spectrum"},{"issue":"5","key":"383_CR14","doi-asserted-by":"publisher","first-page":"3306","DOI":"10.3390\/app13053306","volume":"13","author":"J Mao","year":"2023","unstructured":"Mao J, Cheng J, Li X, Zhao H, Lin C (2023) Modelling analysis of a four-way shuttle-based storage and retrieval system on the basis of operation strategy. Appl Sci 13(5):3306","journal-title":"Appl Sci"},{"key":"383_CR15","doi-asserted-by":"crossref","unstructured":"K\u0131z\u0131l\u0131rmak EB, \u00d6zta\u015f S, \u00c7a\u011flayan N, Tutam M (2024) Design and performance measures of AVS\/R systems: a bibliometric literature review. Arch Comput Methods Eng, 1\u201318","DOI":"10.1007\/s11831-024-10084-9"},{"issue":"15","key":"383_CR16","doi-asserted-by":"publisher","first-page":"4727","DOI":"10.1080\/00207543.2021.1936264","volume":"60","author":"P Yang","year":"2022","unstructured":"Yang P, Jin G, Duan G (2022) Modelling and analysis for multi-deep compact robotic mobile fulfilment system. Int J Prod Res 60(15):4727\u20134742","journal-title":"Int J Prod Res"},{"key":"383_CR17","doi-asserted-by":"publisher","first-page":"109112","DOI":"10.1016\/j.cie.2023.109112","volume":"178","author":"L Luo","year":"2023","unstructured":"Luo L, Zhao N, Zhu Y, Sun Y (2023) A* guiding DQN algorithm for automated guided vehicle pathfinding problem of robotic mobile fulfillment systems. Comput Ind Eng 178:109112","journal-title":"Comput Ind Eng"},{"key":"383_CR18","doi-asserted-by":"publisher","first-page":"108932","DOI":"10.1016\/j.cie.2022.108932","volume":"176","author":"J Lu","year":"2023","unstructured":"Lu J, Ren C, Shao Y, Zhu J, Lu X (2023) An automated guided vehicle conflict-free scheduling approach considering assignment rules in a robotic mobile fulfillment system. Comput Ind Eng 176:108932","journal-title":"Comput Ind Eng"},{"key":"383_CR19","doi-asserted-by":"publisher","first-page":"108856","DOI":"10.1016\/j.cie.2022.108856","volume":"175","author":"G Jiao","year":"2023","unstructured":"Jiao G, Li H, Huang M (2023) Online joint optimization of pick order assignment and pick pod selection in robotic mobile fulfillment systems. Comput Ind Eng 175:108856","journal-title":"Comput Ind Eng"},{"key":"383_CR20","doi-asserted-by":"crossref","unstructured":"Tadumadze G, Wenzel J, Emde S, Weidinger F, Elbert R (2023) Assigning orders and pods to picking stations in a multi-level robotic mobile fulfillment system. Flex Serv Manuf J, 1\u201338","DOI":"10.1007\/s10696-023-09491-0"},{"issue":"10","key":"383_CR21","doi-asserted-by":"publisher","first-page":"7600","DOI":"10.3934\/jimo.2023010","volume":"19","author":"H Li","year":"2023","unstructured":"Li H, Zhu H, Xu D, Lin X, Jiao G, Song Y, Huang M (2023) Dynamic task allocation based on auction in robotic mobile fulfilment system. J Ind Manag Optim 19(10):7600\u20137615","journal-title":"J Ind Manag Optim"},{"issue":"3","key":"383_CR22","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.ejor.2021.09.001","volume":"300","author":"T Lamballais","year":"2022","unstructured":"Lamballais T, Merschformann M, Roy D, Koster MBM, Azadeh K, Suhl L (2022) Dynamic policies for resource reallocation in a robotic mobile fulfillment system with time-varying demand. Eur J Oper Res 300(3):937\u2013952","journal-title":"Eur J Oper Res"},{"key":"383_CR23","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/1428072","volume":"28","author":"QM He","year":"1996","unstructured":"He QM (1996) Queues with marked customers. Adv Appl Probab 28:567\u2013587","journal-title":"Adv Appl Probab"},{"key":"383_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32072-0","volume-title":"The theory of queuing systems with correlated flows","author":"AN Dudin","year":"2020","unstructured":"Dudin AN, Klimenok VI, Vishnevsky VM (2020) The theory of queuing systems with correlated flows. Springer, Switzerland"},{"key":"383_CR25","first-page":"21","volume":"1","author":"SR Chakravarthy","year":"2001","unstructured":"Chakravarthy SR (2001) The batch Markovian arrival process: a review and future work. Adv Probab Theory Stoch Process 1:21\u201349","journal-title":"Adv Probab Theory Stoch Process"},{"key":"383_CR26","volume-title":"Introduction to matrix-analytic methods in queues 1: analytical and simulation approach - basics","year":"2022","unstructured":"Chakravarthy SR (ed) (2022) Introduction to matrix-analytic methods in queues 1: analytical and simulation approach - basics. ISTE Ltd, London and John Wiley and Sons, New York"},{"key":"383_CR27","volume-title":"Introduction to matrix-analytic methods in queues 2: analytical and simulation approach - queues and simulation","year":"2022","unstructured":"Chakravarthy SR (ed) (2022) Introduction to matrix-analytic methods in queues 2: analytical and simulation approach - queues and simulation. ISTE Ltd, London and John Wiley and Sons, New York"},{"key":"383_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15326349108807174","volume":"7","author":"D Lucantoni","year":"1991","unstructured":"Lucantoni D (1991) New results on the single server queue with a batch Markovian arrival process. Commun-Stat-Stoch Model 7:1\u201346","journal-title":"Commun-Stat-Stoch Model"},{"issue":"3","key":"383_CR29","first-page":"193","volume":"45","author":"CS Kim","year":"2019","unstructured":"Kim CS, Dudin S (2019) Analysis of semi-open queueing network with customer retrials. J Korean Inst Ind Eng 45(3):193\u2013202","journal-title":"J Korean Inst Ind Eng"},{"issue":"8","key":"383_CR30","doi-asserted-by":"publisher","first-page":"715","DOI":"10.3390\/math7080715","volume":"7","author":"C Kim","year":"2019","unstructured":"Kim C, Dudin S, Dudin A, Samouylov K (2019) Analysis of a semi-open queuing network with a state dependent marked Markovian arrival process, customers retrials and impatience. Mathematics 7(8):715","journal-title":"Mathematics"},{"key":"383_CR31","unstructured":"Strelen JC (1997) Approximate analysis of queueing networks with Markovian arrival processes and phase type service times. MMB, 55\u201370"},{"key":"383_CR32","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/15326348508807021","volume":"1","author":"V Ramaswami","year":"1985","unstructured":"Ramaswami V (1985) Independent Markov processes in parallel. Comm Statist-Stochastic Models 1:419\u2013432","journal-title":"Comm Statist-Stochastic Models"},{"key":"383_CR33","doi-asserted-by":"crossref","unstructured":"Kim CS, Dudin SA, S TO, Baek J (2013) Queueing system $$MAP\/PH\/N\/N+R$$ with impatient heterogeneous customers as a model of call center. Appl Math Model 37:958\u2013976","DOI":"10.1016\/j.apm.2012.03.021"},{"key":"383_CR34","volume-title":"Kronecker products and matrix calculus with applications","year":"2018","unstructured":"Graham A (ed) (2018) Kronecker products and matrix calculus with applications. Courier Dover Publications, New York"},{"key":"383_CR35","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1016\/j.procs.2010.04.175","volume":"1","author":"H Baumann","year":"2010","unstructured":"Baumann H, Sandmann W (2010) Numerical solution of level dependent quasi-birth-and-death processes. Procedia Comput Sci 1:1561\u20131569","journal-title":"Procedia Comput Sci"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00383-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00383-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00383-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T16:03:45Z","timestamp":1734710625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00383-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["383"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00383-z","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"27 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approvals and Consent to Participate"}},{"value":"The authors consent to publish the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing of Interest"}}],"article-number":"99"}}