{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T21:40:47Z","timestamp":1782164447374,"version":"3.54.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T00:00:00Z","timestamp":1433894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["13-07-00008"],"award-info":[{"award-number":["13-07-00008"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["14-07-31007"],"award-info":[{"award-number":["14-07-31007"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["15-07-02341"],"award-info":[{"award-number":["15-07-02341"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["15-07-02354"],"award-info":[{"award-number":["15-07-02354"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["15-07-02360"],"award-info":[{"award-number":["15-07-02360"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-015-1917-2","type":"journal-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T12:40:20Z","timestamp":1433940020000},"page":"29-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Stability criterion of a multiserver model with simultaneous service"],"prefix":"10.1007","volume":"252","author":[{"given":"Alexander","family":"Rumyantsev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evsey","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,10]]},"reference":[{"key":"1917_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650","volume-title":"The theory of partitions","author":"GE Andrews","year":"1984","unstructured":"Andrews, G. E. (1984). The theory of partitions. Cambridge: Cambridge University Press."},{"key":"1917_CR2","unstructured":"Arthurs, E., & Kaufman, J. S. (1979). Sizing a message store subject to blocking criteria. In Proceedings of the third international symposium on modelling and performance evaluation of computer systems: Performance of computer systems (pp. 547\u2013564). Amsterdam: North-Holland Publishing Co."},{"key":"1917_CR3","volume-title":"Applied probability and queues","author":"S Asmussen","year":"2003","unstructured":"Asmussen, S. (2003). Applied probability and queues. New York: Springer."},{"key":"1917_CR4","unstructured":"Brill, P. (1975). System point theory in exponential queues. Ph.D. thesis, University of Toronto."},{"issue":"1","key":"1917_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1287\/mnsc.30.1.51","volume":"30","author":"P Brill","year":"1984","unstructured":"Brill, P., & Green, L. (1984). Queues in which customers receive simultaneous service from a random number of servers: A system point approach. Management Science, 30(1), 51\u201368.","journal-title":"Management Science"},{"issue":"1","key":"1917_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.6.1.31","volume":"6","author":"P Brill","year":"1981","unstructured":"Brill, P., & Posner, M. (1981). The system point method in exponential queues: A level crossing approach. Mathematics of Operations Research, 6(1), 31\u201349.","journal-title":"Mathematics of Operations Research"},{"key":"1917_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09421-2","volume-title":"Level crossing methods in stochastic models","author":"PH Brill","year":"2008","unstructured":"Brill, P. H. (2008). Level crossing methods in stochastic models. New York: Springer-US."},{"key":"1917_CR8","volume-title":"Introductory combinatorics","author":"RA Brualdi","year":"2009","unstructured":"Brualdi, R. A. (2009). Introductory combinatorics (5th ed.). New York: Pearson.","edition":"5"},{"issue":"1","key":"1917_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.cor.2012.08.002","volume":"40","author":"S Chakravarthy","year":"2013","unstructured":"Chakravarthy, S., & Karatza, H. (2013). Two-server parallel system with pure space sharing and markovian arrivals. Computers & Operations Research, 40(1), 510\u2013519.","journal-title":"Computers & Operations Research"},{"key":"1917_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1968802","volume":"43","author":"P Erd\u0151s","year":"1942","unstructured":"Erd\u0151s, P. (1942). On an elementary proof of some asymptotic formulas in the theory of partitions. Annals of Mathematics Second Series, 43, 437\u2013450.","journal-title":"Annals of Mathematics Second Series"},{"issue":"3","key":"1917_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S0021900200028783","volume":"21","author":"A Federgruen","year":"1984","unstructured":"Federgruen, A., & Green, L. (1984). An M\/G\/c queue in which the number of servers required is random. Journal of Applied Probability, 21(3), 583.","journal-title":"Journal of Applied Probability"},{"issue":"5\u20136","key":"1917_CR12","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.mcm.2006.06.007","volume":"45","author":"D Filippopoulos","year":"2007","unstructured":"Filippopoulos, D., & Karatza, H. (2007). An M\/M\/2 parallel system model with pure space sharing among rigid jobs. Mathematical and Computer Modelling, 45(5\u20136), 491\u2013530.","journal-title":"Mathematical and Computer Modelling"},{"key":"1917_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(86)90299-7","volume":"23","author":"GY Fletcher","year":"1986","unstructured":"Fletcher, G. Y., Perros, H., & Stewart, W. (1986). A queueing system where customers require a random number of servers simultaneously. European Journal of Operational Research, 23, 331\u2013342.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1917_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(83)90077-2","volume":"13","author":"F Gillent","year":"1983","unstructured":"Gillent, F., & Latouche, G. (1983). Semi-explicit solutions for M\/PH\/1-like queuing systems. European Journal of Operational Research, 13(2), 151\u2013160. doi:\n                        10.1016\/0377-2217(83)90077-2\n                        \n                    .","journal-title":"European Journal of Operational Research"},{"key":"1917_CR15","unstructured":"Green, L. (1978). Queues which allow a random number of servers per customer. Ph.D. thesis, Yale University."},{"issue":"1","key":"1917_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1287\/mnsc.27.1.65","volume":"27","author":"L Green","year":"1980","unstructured":"Green, L. (1980a). Comparing operating characteristics of queues in which customers require a random number of servers. Management Science, 27(1), 65\u201374.","journal-title":"Management Science"},{"issue":"6","key":"1917_CR17","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1287\/opre.28.6.1335","volume":"28","author":"L Green","year":"1980","unstructured":"Green, L. (1980b). A queueing system in which customers require a random number of servers. Operations Research, 28(6), 1335\u20131346.","journal-title":"Operations Research"},{"key":"1917_CR18","volume-title":"Fundamentals of matrix-analytic methods","author":"QM He","year":"2014","unstructured":"He, Q. M. (2014). Fundamentals of matrix-analytic methods. New York: Springer."},{"key":"1917_CR19","volume-title":"Markov processes for stochastic modeling","author":"OC Ibe","year":"2009","unstructured":"Ibe, O. C. (2009). Markov processes for stochastic modeling. Amsterdam, Boston: Academic Press."},{"issue":"4","key":"1917_CR20","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1287\/opre.39.4.633","volume":"39","author":"P Ittimakin","year":"1991","unstructured":"Ittimakin, P., & Kao, E. P. C. (1991). Stationary waiting time distribution of a queue in which customers require a random number of servers. Operations Research, 39(4), 633\u2013638.","journal-title":"Operations Research"},{"issue":"10","key":"1917_CR21","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TCOM.1981.1094894","volume":"29","author":"J Kaufman","year":"1981","unstructured":"Kaufman, J. (1981). Blocking in a shared resource environment. IEEE Transactions on Communications, 29(10), 1474\u20131481.","journal-title":"IEEE Transactions on Communications"},{"key":"1917_CR22","unstructured":"Kim, S. (1979). M\/M\/s queueing system where customers demand multiple server use. Ph.D. thesis, Southern Methodist University."},{"issue":"1","key":"1917_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-4149(90)90061-V","volume":"34","author":"C Kipnis","year":"1990","unstructured":"Kipnis, C., & Robert, P. (1990). A dynamic storage process. Stochastic processes and their applications, 34(1), 155\u2013169.","journal-title":"Stochastic processes and their applications"},{"key":"1917_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719734","volume-title":"Introduction to matrix analytic methods in stochastic modeling","author":"G Latouche","year":"1999","unstructured":"Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. Philadelphia: ASA-SIAM."},{"key":"1917_CR25","volume-title":"Matrix-geometric solutions in stochastic models","author":"MF Neuts","year":"1980","unstructured":"Neuts, M. F. (1980). Matrix-geometric solutions in stochastic models. Baltimore: Johns Hopkins University Press."},{"key":"1917_CR26","volume-title":"Matrix-geometric solutions in stochastic models","author":"MF Neuts","year":"1981","unstructured":"Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models. Baltimore: Johns Hopkins University Press."},{"issue":"5","key":"1917_CR27","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/mnsc.35.5.614","volume":"35","author":"C Schaack","year":"1989","unstructured":"Schaack, C., & Larson, R. C. (1989). An N server cutoff priority queue where arriving customers request a random number of servers. Management Science, 35(5), 614\u2013634.","journal-title":"Management Science"},{"issue":"5","key":"1917_CR28","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1287\/opre.32.5.1181","volume":"32","author":"AF Seila","year":"1984","unstructured":"Seila, A. F. (1984). On waiting times for a queue in which customers require simultaneous service from a random number of servers. Operations Research, 32(5), 1181\u20131184.","journal-title":"Operations Research"},{"issue":"3","key":"1917_CR29","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11122-005-0029-z","volume":"41","author":"O Tikhonenko","year":"2005","unstructured":"Tikhonenko, O. (2005). Generalized Erlang problem for service systems with finite total capacity. Problems of Information Transmission, 41(3), 243\u2013253.","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"1917_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0167-6377(89)90033-3","volume":"8","author":"NM Dijk Van","year":"1989","unstructured":"Van Dijk, N. M. (1989). Blocking of finite source inputs which require simultaneous servers with general think and holding times. Operations Research Letters, 8(1), 45\u201352.","journal-title":"Operations Research Letters"},{"issue":"8","key":"1917_CR31","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1002\/j.1538-7305.1985.tb00038.x","volume":"64","author":"W Whitt","year":"1985","unstructured":"Whitt, W. (1985). Blocking when service is required from several facilities simultaneously. AT&T Technical Journal, 64(8), 1807\u20131856.","journal-title":"AT&T Technical Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1917-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1917-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1917-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1917-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:00Z","timestamp":1559139000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1917-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,10]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1917"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1917-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,10]]}}}