{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:43:21Z","timestamp":1648885401242},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T00:00:00Z","timestamp":1201564800000},"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":[[2008,2]]},"DOI":"10.1007\/s11134-008-9062-0","type":"journal-article","created":{"date-parts":[[2008,1,28]],"date-time":"2008-01-28T17:13:00Z","timestamp":1201540380000},"page":"105-119","source":"Crossref","is-referenced-by-count":1,"title":["Some first passage time problems for the shortest queue model"],"prefix":"10.1007","volume":"58","author":[{"given":"Haishen","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Knessl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,29]]},"reference":[{"key":"9062_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02024665","volume":"48","author":"I. Adan","year":"1994","unstructured":"Adan, I., van Houtum, G.J., van der Wal, J.: Upper and lower bounds for the waiting time in the symmetric shortest queue problem. Ann. Oper. Res. 48, 197\u2013217 (1994)","journal-title":"Ann. Oper. Res."},{"key":"9062_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1080\/15326349908807169","volume":"6","author":"I.J.B.F. Adan","year":"1990","unstructured":"Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: Analysis of the asymmetric shortest queue problem. Commun. Stat. Stoch. Models 6, 691\u2013713 (1990)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9062_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02412240","volume":"8","author":"I.J.B.F. Adan","year":"1991","unstructured":"Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: Analysis of the asymmetric shortest queue problem. Queuing Syst. Theory Appl. 8, 1\u201358 (1991)","journal-title":"Queuing Syst. Theory Appl."},{"key":"9062_CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1080\/15326349108807209","volume":"7","author":"I.J.B.F. Adan","year":"1991","unstructured":"Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: Analysis of the symmetric shortest queue problem with threshold jockeying. Commun. Stat. Stoch. Models 7, 615\u2013627 (1991)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9062_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(93)90037-H","volume":"2","author":"I.J.B.F. Adan","year":"1993","unstructured":"Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: Matrix-geometric analysis of the shortest queue problem with threshold jockeying. Oper. Res. Lett. 2, 107\u2013112 (1993)","journal-title":"Oper. Res. Lett."},{"key":"9062_CR6","volume-title":"Boundary Value Problems in Queueing System Analysis","author":"J.W. Cohen","year":"1983","unstructured":"Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. North-Holland, Amsterdam (1983)"},{"key":"9062_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/cpa.3160300206","volume":"30","author":"L. Flatto","year":"1977","unstructured":"Flatto, L., McKean, H.: Two queues in parallel. Commun. Pure Appl. Math. 30, 255\u2013263 (1977)","journal-title":"Commun. Pure Appl. Math."},{"key":"9062_CR8","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1214\/aoap\/1015345342","volume":"11","author":"R.D. Foley","year":"2001","unstructured":"Foley, R.D., McDonald, D.R.: Join the shortest queue: stability and exact asymptotics. Ann. Appl. Probab. 11, 569\u2013607 (2001)","journal-title":"Ann. Appl. Probab."},{"key":"9062_CR9","first-page":"499","volume-title":"Computer Performance","author":"G. Foschini","year":"1977","unstructured":"Foschini, G.: On heavy traffic diffusion analysis and dynamic routing in packet switched networks. In: Chandy, K., Reiser, M. (eds.) Computer Performance, pp. 499\u2013513. North-Holland, Amsterdam (1977)"},{"key":"9062_CR10","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TCOM.1978.1094075","volume":"26","author":"G. Foschini","year":"1978","unstructured":"Foschini, G., Salz, J.: A basic dynamic routing problem and diffusion. IEEE Trans. Commun. 26, 320\u2013327 (1978)","journal-title":"IEEE Trans. Commun."},{"key":"9062_CR11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0377-2217(84)90106-1","volume":"15","author":"I. Gertsbakh","year":"1984","unstructured":"Gertsbakh, I.: The shorter queue problem: a numerical study using the matrix-geometric solution. Eur. J. Oper. Res. 15, 374\u2013381 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9062_CR12","doi-asserted-by":"crossref","first-page":"865","DOI":"10.2307\/3213954","volume":"22","author":"S. Halfin","year":"1985","unstructured":"Halfin, S.: The shortest queue problem. J. Appl. Probab. 22, 865\u2013878 (1985)","journal-title":"J. Appl. Probab."},{"key":"9062_CR13","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1214\/aoms\/1177704869","volume":"32","author":"J.F.C. Kingman","year":"1961","unstructured":"Kingman, J.F.C.: Two similar queues in parallel. Ann. Math. Stat. 32, 1314\u20131323 (1961)","journal-title":"Ann. Math. Stat."},{"key":"9062_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/15326349508807335","volume":"11","author":"C. Knessl","year":"1995","unstructured":"Knessl, C., Tier, C.: Asymptotic properties of first passage times for tandem Jackson networks I: buildup of large queue lengths. Commun. Stat. Stoch. Models 11, 133\u2013162 (1995)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9062_CR15","first-page":"365","volume":"45","author":"B.J. Matkowsky","year":"1985","unstructured":"Matkowsky, B.J., Schuss, Z.: The exit time problem for randomly perturbed dynamical systems. SIAM J. Appl. Math. 45, 365\u2013382 (1985)","journal-title":"SIAM J. Appl. Math."},{"key":"9062_CR16","series-title":"Lecture Notes in Statistics","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-1-4612-4062-4_9","volume-title":"Stochastic Networks","author":"D. McDonald","year":"1996","unstructured":"McDonald, D.: Overloading parallel servers when arrivals join the shortest queue. In: Stochastic Networks. Lecture Notes in Statistics, vol. 117, pp. 169\u2013196. Springer, New York (1996)"},{"key":"9062_CR17","volume-title":"Passage Times for Markov Chains","author":"R. Syski","year":"1992","unstructured":"Syski, R.: Passage Times for Markov Chains. IOS Press, Amsterdam (1992)"},{"key":"9062_CR18","unstructured":"van Houtum, G.J.: New approaches for multi-dimensional queueing systems. Ph.D. thesis, Eindhoven University of Technology (1994)"},{"key":"9062_CR19","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00013360","volume":"23","author":"G.J. Houtum van","year":"2001","unstructured":"van Houtum, G.J., Adan, I.J.B.F., Wessels, J., Zijm, W.H.M.: Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism. OR Spectr. 23, 411\u2013427 (2001)","journal-title":"OR Spectr."},{"key":"9062_CR20","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":"Wang, P.P.: Workload distribution of discrete time parallel queues with two servers. Nav. Res. Logist. 47, 440\u2013454 (2000)","journal-title":"Nav. Res. Logist."},{"key":"9062_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0167-6377(97)00041-2","volume":"21","author":"P. Wu","year":"1997","unstructured":"Wu, P., Posner, M.J.M.: A level-crossing approach to the solution of the shortest queue problem. Oper. Res. Lett. 21, 181\u2013189 (1997)","journal-title":"Oper. Res. Lett."},{"key":"9062_CR22","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":"Zhao, Y.Q., Grassman, W.K.: The shortest queue model with jockeying. Nav. Res. Logist. 37, 773\u2013787 (1990)","journal-title":"Nav. Res. Logist."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9062-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-008-9062-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9062-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T21:02:30Z","timestamp":1630616550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-008-9062-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,29]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9062"],"URL":"https:\/\/doi.org\/10.1007\/s11134-008-9062-0","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,29]]}}}