{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:38:30Z","timestamp":1766306310687,"version":"3.48.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:00:00Z","timestamp":1759536000000},"content-version":"vor","delay-in-days":276,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100015174","name":"Canadian Defence Academy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015174","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.10.037","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:48Z","timestamp":1762467228000},"page":"5685-5694","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Proof and Application of Little\u2019s Formula in Optimizing Bulk-service Multi-server Queue Systems"],"prefix":"10.1016","volume":"270","author":[{"given":"Jing","family":"Gai","sequence":"first","affiliation":[]},{"given":"Mohan","family":"Chaudhry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"Bar-Lev, S.K., Boxma, O., Kleiner, I., Perry, D. & Stadje, W. (2017), Recycled Incomplete identification procedures for blood screening. European Journal of OPerational Research, 259-1, 330-343.","key":"10.1016\/j.procs.2025.10.037_bib1","DOI":"10.1016\/j.ejor.2016.10.005"},{"doi-asserted-by":"crossref","unstructured":"Chaudhry, M. & Gai, J. (2022), Analytic and Computational Analysis of GI\/Ma,b\/c Queueing System. Mathematics., 10(19), 5-26.","key":"10.1016\/j.procs.2025.10.037_bib2","DOI":"10.3390\/math10193445"},{"unstructured":"Chaudhry, M. & Madill, B. (1987), Probabilities and some measures of efficiency in the queueing system GI\/Ma,b\/1. Selecta Statistica Canadiana, 7, 53-75.","key":"10.1016\/j.procs.2025.10.037_bib3"},{"doi-asserted-by":"crossref","unstructured":"Easton, G. & Chaudhry, M. (1982), The queueing system Ek\/Ma,b\/1 and its numerical analysis. Comput. Oper. Res., 9, 197-205.","key":"10.1016\/j.procs.2025.10.037_bib4","DOI":"10.1016\/0305-0548(82)90018-1"},{"unstructured":"Gai, J. & Chaudhry, M.L. (2024), Waiting Times in Queueing System GI\/Ma,b \/c. Queuieng Models and Service Management\u201c 7-1, 43-65.","key":"10.1016\/j.procs.2025.10.037_bib5"},{"doi-asserted-by":"crossref","unstructured":"Little, J.D.C.(1961) A proof for the queueing formula: L = \u03bbW. Operations Research\u201c 9,383-387.","key":"10.1016\/j.procs.2025.10.037_bib6","DOI":"10.1287\/opre.9.3.383"},{"doi-asserted-by":"crossref","unstructured":"Little, J.D.C.(2011) Little\u2019s Law as viewed on its 50th anniversary. Operations Research\u201c 59-3,536-549.","key":"10.1016\/j.procs.2025.10.037_bib7","DOI":"10.1287\/opre.1110.0940"},{"doi-asserted-by":"crossref","unstructured":"Samanta, S.K., M. & Bank, B. (2022), Extended Analysis and Computationally Efficient Results for the GI\/Ma,b\/1. Communications in Statistics - Theory and Methods, 51:11, 3739-3760.","key":"10.1016\/j.procs.2025.10.037_bib8","DOI":"10.1080\/03610926.2020.1801739"},{"doi-asserted-by":"crossref","unstructured":"Sim, S. & Templeton, J. (1985), Steady state results for the M\/Ma,b\/c batch-service system. Eur. J. Oper. Res., 21, 260-267.","key":"10.1016\/j.procs.2025.10.037_bib9","DOI":"10.1016\/0377-2217(85)90038-4"},{"unstructured":"Shyu, K. (1964), The waiting time distribution for the queueing processes in the system GI\/M\/n with bulk service. Acta. Math. Sin., 14, 796-808.","key":"10.1016\/j.procs.2025.10.037_bib10"},{"unstructured":"Takacs, L. (1962), Introduction to the Theory of Queues; Oxford University Press, New York.","key":"10.1016\/j.procs.2025.10.037_bib11"},{"unstructured":"Tamrakar, G.K. & Banerjee, A. (2023), On Steady state analysis of an infinite capacity Mx\/Ma,y\/1 queue with optional service and queue length dependent single (multiple) vacation. Queueing Models and Service Management, 6-1, 27-61.","key":"10.1016\/j.procs.2025.10.037_bib12"},{"doi-asserted-by":"crossref","unstructured":"Whitt, W. (1991), A review of L = \u03bbW and extensions. Queuieng Systems, 9(3), 235-268.","key":"10.1016\/j.procs.2025.10.037_bib13","DOI":"10.1007\/BF01158466"},{"unstructured":"Wolf, R.W. (2011), Little\u2019s Law and related results. Wiley Encyclopedia of Operations Research and Management Science, John Wiley & sons, Hoboken, NJ, 2828-281.","key":"10.1016\/j.procs.2025.10.037_bib14"},{"doi-asserted-by":"crossref","unstructured":"Yao, D. & Chaudhry, M.L. (1984), A note on some relations in queue GIX\/M\/c. Operat. Res. Letters\u201c 3, 53-56.","key":"10.1016\/j.procs.2025.10.037_bib15","DOI":"10.1016\/0167-6377(84)90072-5"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925033708?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925033708?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:35:16Z","timestamp":1766306116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925033708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":15,"alternative-id":["S1877050925033708"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.037","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Proof and Application of Little\u2019s Formula in Optimizing Bulk-service Multi-server Queue Systems","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.037","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Crown Copyright \u00a9 2025 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}