{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T19:55:39Z","timestamp":1782330939795,"version":"3.54.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"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":[[2006,2]]},"DOI":"10.1007\/s11134-006-5500-z","type":"journal-article","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T09:20:41Z","timestamp":1140686441000},"page":"157-177","source":"Crossref","is-referenced-by-count":10,"title":["On the infinite server shortest queue problem: Non-symmetric case"],"prefix":"10.1007","volume":"52","author":[{"given":"Haishen","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Knessl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5500_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02024665","volume":"48","author":"I. Adan","year":"1994","unstructured":"I. Adan, G.J. van Houtum and J. van der Wal, Upper and lower bounds for the waiting time in the symmetric shortest queue problem, Ann. Oper. Res. 48 (1994) 197\u2013217.","journal-title":"Ann. Oper. Res."},{"key":"5500_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1080\/15326349908807169","volume":"6","author":"I.J.B.F. Adan","year":"1990","unstructured":"I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the symmetric shortest queue problem, Comm. Statist. Stochastic Models 6 (1990) 691\u2013713.","journal-title":"Comm. Statist. Stochastic Models"},{"key":"5500_CR3","doi-asserted-by":"crossref","unstructured":"I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the symmetric shortest queue problem with threshold jockeying, Comm. Statist, Stochastic Models 7 (1991) 615\u2013627.","DOI":"10.1080\/15326349108807209"},{"key":"5500_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02412240","volume":"8","author":"I.J.B.F. Adan","year":"1991","unstructured":"I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the asymmetric shortest queue problem, Queueing Systems Theory Appl. 8 (1991) 1\u201358.","journal-title":"Queueing Systems Theory Appl."},{"key":"5500_CR5","doi-asserted-by":"crossref","unstructured":"I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Matrix-geometric analysis of the shortest queue problem with threshold jockeying, Oper. Res. Lett. 2 (1993) 107\u2013112.","DOI":"10.1016\/0167-6377(93)90037-H"},{"key":"5500_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1214\/aoap\/1027961033","volume":"8","author":"M. Alanyali","year":"1998","unstructured":"M. Alanyali and B. Hajek, On large deviations of Markov processes with discontinuous statistics, Ann. Appl. Probab. 8 (1998) 45\u201366.","journal-title":"Ann. Appl. Probab."},{"key":"5500_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1214\/aoap\/1027961034","volume":"8","author":"M. Alanyali","year":"1998","unstructured":"M. Alanyali and B. Hajek, On large deviations in load sharing networks, Ann. Appl. Probab. 8 (1998) 67\u201397.","journal-title":"Ann. Appl. Probab."},{"key":"5500_CR8","volume-title":"Advanced Mathematical Methods for Scientists and Engineers","author":"C.M. Bender","year":"1978","unstructured":"C.M. Bender and S.A. Orszag, Advanced Mathematical Methods for Scientists and Engineers (McGraw Hill, New York, 1978)."},{"key":"5500_CR9","unstructured":"J.W. Cohen and O.J. Boxma, Boundary Value Problems in Queueing System Analysis (North Holland, 1983)."},{"key":"5500_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/cpa.3160300206","volume":"30","author":"L. Flatto","year":"1977","unstructured":"L. Flatto and H. McKean, Two queues in parallel, Commun. Pure Appl. Math. 30 (1977) 255\u2013263.","journal-title":"Commun. Pure Appl. Math."},{"key":"5500_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0269964899133011","volume":"13","author":"P.J. Fleming","year":"1999","unstructured":"P.J. Fleming and B. Simon, Heavy traffic approximations for a system of infinite servers with load balancing, Probab. Eng. Info. Sci. 13 (1999) 251\u2013273.","journal-title":"Probab. Eng. Info. Sci."},{"key":"5500_CR12","unstructured":"M.I. Friedlin and A.D. Wentzell, Fluctuations in Dynamical Systems Subject to Small Random Perturbations (in Russian) (\u201cNauka\u201d, Moscow, 1979)."},{"key":"5500_CR13","doi-asserted-by":"crossref","first-page":"865","DOI":"10.2307\/3213954","volume":"22","author":"S. Halfin","year":"1985","unstructured":"S. Halfin, The shortest queue problem, J. Appl. Probab. 22 (1985) 865\u2013878.","journal-title":"J. Appl. Probab."},{"key":"5500_CR14","doi-asserted-by":"crossref","unstructured":"R. Hariharan, V.G. Kulkarni and S. Stidham, Optimal control of two infinite server queues, in: Proceedings of the 29th IEEE Conference on Decision and Control (1990) Hawaii.","DOI":"10.1109\/CDC.1990.203824"},{"key":"5500_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1090\/S0002-9904-1978-14505-4","volume":"84","author":"J.B. Keller","year":"1978","unstructured":"J.B. Keller, Rays, waves and asymptotics, Bull. Amer. Soc. 84 (1978) 727\u2013750.","journal-title":"waves and asymptotics, Bull. Amer. Soc."},{"key":"5500_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4213-8","volume-title":"Perturbation Methods in Applied Mathematics","author":"J. Kevorkian","year":"1981","unstructured":"J. Kevorkian and J.D. Cole, Perturbation Methods in Applied Mathematics (Springer-Verlag, New York, 1981)."},{"key":"5500_CR17","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1214\/aoms\/1177704869","volume":"32","author":"J.F.C. Kingman","year":"1961","unstructured":"J.F.C. Kingman, Two similar queues in parallel, Annals Math. Statist. 32 (1961) 1314\u20131323.","journal-title":"Annals Math. Statist."},{"key":"5500_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S0956792599003861","volume":"10","author":"C. Knessl","year":"1999","unstructured":"C. Knessl, A new heavy traffic limit for the asymmetric shortest queue problem, Eur. J. Appl. Math. 10 (1999) 497\u2013509.","journal-title":"Eur. J. Appl. Math."},{"key":"5500_CR19","doi-asserted-by":"crossref","unstructured":"M. Reiman, Some diffusion approximations with state space collapse, in: Modelling and Performance Evaluation Methodology, eds., A.V. Balakreshnan and M. Thomas (Springer-Verlag, 1984) pp. 209\u2013240.","DOI":"10.1007\/BFb0005175"},{"key":"5500_CR20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1017\/S0021900200015357","volume":"37","author":"S.R.E. Turner","year":"2000","unstructured":"S.R.E. Turner, A join the shorter queue model in heavy traffic, J. Appl. Probab. 37 (2000) 212\u2013223.","journal-title":"J. Appl. Probab."},{"key":"5500_CR21","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1002\/1520-6750(200008)47:5<440::AID-NAV5>3.0.CO;2-W","volume":"47","author":"P.P. Wang","year":"2000","unstructured":"P.P. Wang, Workload distribution of discrete time parallel queues with two servers, Naval Res. Logist. 47 (2000) 440\u2013454.","journal-title":"Naval Res. Logist."},{"key":"5500_CR22","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0167-6377(97)00041-2","volume":"21","author":"P. Wu","year":"1997","unstructured":"P. Wu and M.J.M. Posner, A level-crossing approach to the solution of the shortest queue problem, Oper. Res. Lett. 21 (1997) 181\u2013189.","journal-title":"Oper. Res. Lett."},{"key":"5500_CR23","unstructured":"H. Yao and C. Knessl, On the infinite server shortest queue problem: non-symmetric case, MSCS Technical Report, University of Illinois at Chicago (2004)."},{"key":"5500_CR24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1081\/STM-200046493","volume":"21","author":"H. Yao","year":"2005","unstructured":"H. Yao and C. Knessl, On the infinite server shortest queue problem: symmetric case, Stochastic Models 21 (2005) 101\u2013132.","journal-title":"Stochastic Models"},{"key":"5500_CR25","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1002\/1520-6750(199010)37:5<773::AID-NAV3220370514>3.0.CO;2-2","volume":"37","author":"Y.Q. Zhao","year":"1990","unstructured":"Y.Q. Zhao and W.K. Grassman, The shortest queue model with jockeying, Naval Res. Logist. 37 (1990) 773\u2013787.","journal-title":"Naval Res. Logist."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-5500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-006-5500-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-5500-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:44:36Z","timestamp":1559375076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-006-5500-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["5500"],"URL":"https:\/\/doi.org\/10.1007\/s11134-006-5500-z","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}