{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:28:26Z","timestamp":1754483306374,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01148946","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T11:57:11Z","timestamp":1107863831000},"page":"193-214","source":"Crossref","is-referenced-by-count":8,"title":["Lattice path counting andM\/M\/c queueing systems"],"prefix":"10.1007","volume":"19","author":[{"given":"Kiyoshi","family":"Muto","sequence":"first","affiliation":[]},{"given":"Haruo","family":"Miyazaki","sequence":"additional","affiliation":[]},{"given":"Yoichi","family":"Seki","sequence":"additional","affiliation":[]},{"given":"Yoshihiro","family":"Kimura","sequence":"additional","affiliation":[]},{"given":"Yukio","family":"Shibata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1111\/j.1467-9574.1984.tb01110.x","volume":"38","author":"O.J. Boxma","year":"1984","unstructured":"O.J. Boxma, The joint arrival and departure process for theM\/M\/1 queue, Stat. Neerlandica 38 (1984) 199?208.","journal-title":"Stat. Neerlandica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0378-3758(93)90031-Z","volume":"34","author":"W. B\u00f6hm","year":"1993","unstructured":"W. B\u00f6hm and S.G. Mohanty, The transient solution ofM\/M\/1 queues under(M, N)-policy. A combinatorial approach, J. Stat. Plann. Inference 34 (1993) 23?33.","journal-title":"J. Stat. Plann. Inference"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/j.2517-6161.1956.tb00217.x","volume":"B18","author":"D.G. Champernowne","year":"1956","unstructured":"D.G. Champernowne, An elementary method of the solution of the queueing problem with a single server and constant parameter, J. Roy. Stat. Soc. Ser. B18 (1956) 125?128.","journal-title":"J. Roy. Stat. Soc. Ser."},{"key":"CR4","volume-title":"Fundamentals of Queueing Theory","author":"D. Gross","year":"1985","unstructured":"D. Gross and C.M. Harris,Fundamentals of Queueing Theory (Wiley, New York, 1985)."},{"key":"CR5","volume-title":"Stochastic Models in Queueing Theory","author":"J. Medhi","year":"1991","unstructured":"J. Medhi,Stochastic Models in Queueing Theory (Academic Press, New York, 1991)."},{"key":"CR6","volume-title":"Lattice Path Counting and Applications","author":"S.G. Mohanty","year":"1979","unstructured":"S.G. Mohanty,Lattice Path Counting and Applications (Academic Press, New York, 1979)."},{"key":"CR7","first-page":"364","volume":"52","author":"S.G. Mohanty","year":"1990","unstructured":"S.G. Mohanty and W. Panny, A discrete-time analogue of theM\/M\/1 queue and the transient solution: A geometric approach, Sankhy?, Ser. A, 52 (1990) 364?370.","journal-title":"Sankhy?, Ser. A"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"P.R. Parthasarathy, A transient solution to anM\/M\/1 queue: a simple approach, Adv. Appl. Prob. (1987) 997?998.","DOI":"10.1017\/S0001867800017547"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"584","DOI":"10.2307\/3214415","volume":"26","author":"P.R. Parthasarathy","year":"1989","unstructured":"P.R. Parthasarathy and M. Sharafali, Transient solution to the many server Poisson queue: a simple approach, J. Appl. Prob. 26 (1989) 584?594.","journal-title":"J. Appl. Prob."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1287\/mnsc.28.7.821","volume":"28","author":"C.D. Pegden","year":"1982","unstructured":"C.D. Pegden and M. Rosenshine, Some new results for theM\/M\/1 queue, Manag. Sci. 28 (1982) 821?828.","journal-title":"Manag. Sci."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1287\/opre.8.6.755","volume":"8","author":"T.L. Saaty","year":"1960","unstructured":"T.L. Saaty, Time dependent solution of many server Poisson queue, Oper. Res. 8 (1960) 755?772.","journal-title":"Oper. Res."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-3758(93)90011-T","volume":"34","author":"K. Sen","year":"1993","unstructured":"K. Sen and J.L. Jain, Combinatorial approach to Markovian queueing models, J. Stat. Plann. Inference 34 (1993) 269?279.","journal-title":"J. Stat. Plann. Inference"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0378-3758(93)90010-4","volume":"34","author":"K. Sen","year":"1993","unstructured":"K. Sen, J.L. Jain and J.M. Gupta, Lattice path approach to transient solution ofM\/M\/1 with (0,k) control policy, J. Stat. Plann. Inference 34 (1993) 259?267.","journal-title":"J. Stat. Plann. Inference"},{"key":"CR14","volume-title":"Markovian Queues","author":"O.P. Sharma","year":"1990","unstructured":"O.P. Sharma,Markovian Queues (Ellis Horwood, Chichester, 1990)."},{"key":"CR15","first-page":"327","volume":"57","author":"L. Tak\u00e1cs","year":"1962","unstructured":"L. Tak\u00e1cs, A generalization of the ballot problem and its application in the theory of queues, J. Amer. Stat. Ass. 57 (1962) 327?337.","journal-title":"J. Amer. Stat. Ass."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.10.3.395","volume":"10","author":"L. Tak\u00e1cs","year":"1962","unstructured":"L. Tak\u00e1cs, A single server queues with recurrent input and exponentially distributed service times, Oper. Res. 10 (1962) 395?399.","journal-title":"Oper. Res."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0110053","volume":"10","author":"L. Tak\u00e1cs","year":"1962","unstructured":"L. Tak\u00e1cs, A combinatorial method in the theory of queues, SIAM J. Appl. Math. 10 (1962) 691?694.","journal-title":"SIAM J. Appl. Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1002\/1520-6750(198706)34:3<451::AID-NAV3220340310>3.0.CO;2-8","volume":"34","author":"D. Towsley","year":"1987","unstructured":"D. Towsley, An application of the reflection principle to the transient analysis of theM\/M\/1 queue, Naval. Res. Logist. 34 (1987) 451?456.","journal-title":"Naval. Res. Logist."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01148946.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01148946\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01148946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T05:50:14Z","timestamp":1734933014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01148946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01148946"],"URL":"https:\/\/doi.org\/10.1007\/bf01148946","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}