{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:17Z","timestamp":1759666157575,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11134-017-9556-8","type":"journal-article","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T03:48:33Z","timestamp":1509335313000},"page":"211-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stationary analysis of the shortest queue problem"],"prefix":"10.1007","volume":"87","author":[{"given":"Plinio S.","family":"Dester","sequence":"first","affiliation":[]},{"given":"Christine","family":"Fricker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8647-2575","authenticated-orcid":false,"given":"Danielle","family":"Tibi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"issue":"2","key":"9556_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 system. Ann. Oper. Res. 48(2), 197\u2013217 (1994)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9556_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1080\/15326349908807169","volume":"6","author":"I Adan","year":"1990","unstructured":"Adan, I., Wessels, J., Zijm, W.H.M.: Analysis of the symmetric shortest queue problem. Commun. Stat. Stoch. Models 6(4), 691\u2013713 (1990)","journal-title":"Commun. Stat. Stoch. Models"},{"issue":"1","key":"9556_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02412240","volume":"8","author":"I Adan","year":"1991","unstructured":"Adan, I., Wessels, J., Zijm, W.H.M.: Analysis of the asymmetric shortest queue problem. Queueing Syst. 8(1), 1\u201358 (1991)","journal-title":"Queueing Syst."},{"issue":"4","key":"9556_CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1080\/15326349108807209","volume":"7","author":"I Adan","year":"1991","unstructured":"Adan, I., Wessels, J.: Analysis of the asymmetric shortest queue problem with threshold jockeying. Stoch. Models 7(4), 615\u2013627 (1991)","journal-title":"Stoch. Models"},{"issue":"04","key":"9556_CR5","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1017\/S0001867800025751","volume":"25","author":"I Adan","year":"1993","unstructured":"Adan, I., Wessels, J., Zijm, W.H.M.: A compensation approach for two-dimensional Markov processes. Adv. Appl. Probab. 25(04), 783\u2013817 (1993)","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"9556_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/opre.40.1.157","volume":"40","author":"JP Blanc","year":"1992","unstructured":"Blanc, J.P.: The power-series algorithm applied to the shortest-queue model. Oper. Res. 40(1), 157\u2013167 (1992)","journal-title":"Oper. Res."},{"key":"9556_CR7","first-page":"1","volume":"R 9602","author":"JW Cohen","year":"1996","unstructured":"Cohen, J.W.: On the symmetrical shortest queue and the compensation approach. Dep. Oper. Res. Stat. Syst. Theory BS R 9602, 1\u201321 (1996)","journal-title":"Dep. Oper. Res. Stat. Syst. Theory BS"},{"key":"9556_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-79917-4_9","volume-title":"Quantitative Methods in Parallel Systems","author":"JW Cohen","year":"1995","unstructured":"Cohen, J.W.: Two-dimensional nearest-neighbour queueing models, a review and an example. In: Baccelli, F., Jean-Marie, A., Mitrani, I. (eds.) Quantitative Methods in Parallel Systems, pp. 141\u2013152. Springer, Berlin (1995)"},{"issue":"2","key":"9556_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1155\/S1048953398000112","volume":"11","author":"JW Cohen","year":"1998","unstructured":"Cohen, J.W.: Analysis of the asymmetrical shortest two-server queueing model. Int. J. Stoch. Anal. 11(2), 115\u2013162 (1998)","journal-title":"Int. J. Stoch. Anal."},{"issue":"2","key":"9556_CR10","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1017\/S0021900200024761","volume":"21","author":"BW Conolly","year":"1984","unstructured":"Conolly, B.W.: The autostrada queueing problem. J. Appl. Probab. 21(2), 394\u2013403 (1984)","journal-title":"J. Appl. Probab."},{"key":"9556_CR11","unstructured":"Dester, P.S., Fricker, C.: Local balancing policies in bike-sharing systems. In preparation (2017)"},{"key":"9556_CR12","doi-asserted-by":"crossref","unstructured":"Dester, P.S., Fricker, C., Tibi, D.: Stationary analysis of the shortest queue problem. arXiv:1704.06442 (2017)","DOI":"10.1007\/s11134-017-9556-8"},{"key":"9556_CR13","unstructured":"Eschenfeldt, P., Gamarnik, D.: Join the shortest queue with many servers. The heavy traffic asymptotics. arXiv preprint arXiv:1502.00999 (2015)"},{"issue":"3","key":"9556_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00535168","volume":"47","author":"G Fayolle","year":"1979","unstructured":"Fayolle, G., Iasnogorodski, R.: Two coupled processors: the reduction to a Riemann\u2013Hilbert problem. Z. Wahrscheinlichkeitstheorie verwandte Geb. 47(3), 325\u2013351 (1979)","journal-title":"Z. Wahrscheinlichkeitstheorie verwandte Geb."},{"key":"9556_CR15","doi-asserted-by":"crossref","unstructured":"Fayolle, G., Iasnogorodski, R., Malyshev, V.: Random walks in the quarter plane: algebraic methods, boundary value problems, applications to queueing systems and analytic combinatorics, vol. 40. Springer International Publishing AG, Switzerland (2017)","DOI":"10.1007\/978-3-319-50930-3"},{"issue":"04","key":"9556_CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1017\/S0269964800001376","volume":"3","author":"L Flatto","year":"1989","unstructured":"Flatto, L.: The longer queue model. Probab. Eng. Inf Sci. 3(04), 537\u2013559 (1989)","journal-title":"Probab. Eng. Inf Sci."},{"issue":"2","key":"9556_CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/cpa.3160300206","volume":"30","author":"L Flatto","year":"1977","unstructured":"Flatto, L., McKean, H.P.: Two queues in parallel. Commun. Pure Appl. Math. 30(2), 255\u2013263 (1977)","journal-title":"Commun. Pure Appl. Math."},{"key":"9556_CR18","unstructured":"Foley, R.D., McDonald, D.R.: Join the shortest queue: Stability and exact asymptotics. Ann. Appl. Probab. 11(3), 569\u2013607 (2001)"},{"key":"9556_CR19","doi-asserted-by":"crossref","unstructured":"Fricker, C., Gast, N.: Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. EURO J. Trans. Logist. 1\u201331 (2014)","DOI":"10.1007\/s13676-014-0053-5"},{"issue":"4","key":"9556_CR20","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s11134-013-9383-5","volume":"77","author":"F Guillemin","year":"2014","unstructured":"Guillemin, F., Simonian, A.: Stationary analysis of the shortest queue first service policy. Queueing Syst. 77(4), 393\u2013426 (2014)","journal-title":"Queueing Syst."},{"issue":"3\u20134","key":"9556_CR21","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1093\/biomet\/45.3-4.401","volume":"45","author":"F Haight","year":"1958","unstructured":"Haight, F.: Two queues in parallel. Biometrika 45(3\u20134), 401\u2013410 (1958)","journal-title":"Biometrika"},{"issue":"4","key":"9556_CR22","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1017\/S0021900200108101","volume":"22","author":"S Halfin","year":"1985","unstructured":"Halfin, S.: The shortest queue problem. J. Appl. Probab. 22(4), 865\u2013878 (1985)","journal-title":"J. Appl. Probab."},{"issue":"5","key":"9556_CR23","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1137\/0148069","volume":"48","author":"G Hooghiemstra","year":"1988","unstructured":"Hooghiemstra, G., Keane, M., van de Ree, S.: Power series for stationary distributions of coupled processor models. SIAM J. Appl. Math. 48(5), 1159\u20131166 (1988)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"9556_CR24","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S0269964812000150","volume":"26","author":"MN Katehakis","year":"2012","unstructured":"Katehakis, M.N., Smit, L.C.: A successive lumping procedure for a class of Markov chains. Probab. Eng. Inf. Sci. 26(4), 483\u2013508 (2012)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"2","key":"9556_CR25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1017\/S0269964814000291","volume":"29","author":"MN Katehakis","year":"2015","unstructured":"Katehakis, M.N., Smit, L.C., Spieksma, F.M.: DES and RES processes and their explicit solutions. Probab. Eng. Inf. Sci. 29(2), 191\u2013217 (2015)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"4","key":"9556_CR26","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1214\/aoms\/1177704869","volume":"32","author":"J Kingman","year":"1961","unstructured":"Kingman, J.: Two similar queues in parallel. Ann. Math. Stat. 32(4), 1314\u20131323 (1961)","journal-title":"Ann. Math. Stat."},{"issue":"12","key":"9556_CR27","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1109\/TCOM.1986.1096486","volume":"34","author":"C Knessl","year":"1986","unstructured":"Knessl, C., Matkowsky, B., Schuss, Z., Tier, C.: Two parallel queues with dynamic routing. IEEE Trans. Commun. 34(12), 1170\u20131175 (1986)","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"9556_CR28","doi-asserted-by":"crossref","first-page":"01","DOI":"10.4236\/am.2011.21001","volume":"2","author":"C Knessl","year":"2011","unstructured":"Knessl, C., Yao, H.: On the finite capacity shortest queue problem. Prog. Appl. Math. 2(1), 01\u201334 (2011)","journal-title":"Prog. Appl. Math."},{"issue":"4","key":"9556_CR29","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1214\/aoap\/1069786501","volume":"13","author":"IA Kurkova","year":"2003","unstructured":"Kurkova, I.A., Suhov, Y.M.: Malyshev\u2019s theory and JS-queues. Asymptotics of stationary probabilities. Ann. Appl. Probab. 13(4), 1313\u20131354 (2003)","journal-title":"Ann. Appl. Probab."},{"key":"9556_CR30","doi-asserted-by":"crossref","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.: Introduction to Matrix Analytic Methods in Stochastic Modeling, vol. 5. SIAM, Philadelphia (1999)"},{"issue":"3","key":"9556_CR31","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1080\/15326340701471042","volume":"23","author":"H Li","year":"2007","unstructured":"Li, H., Miyazawa, M., Zhao, Y.Q.: Geometric decay in a QBD process with countable background states with applications to a join-the-shortest-queue model. Stoch. Models 23(3), 413\u2013438 (2007)","journal-title":"Stoch. Models"},{"key":"9556_CR32","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: On the analysis of randomized load balancing schemes. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 292\u2013301. ACM (1997)","DOI":"10.1145\/258492.258521"},{"issue":"3","key":"9556_CR33","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1287\/moor.1070.0263","volume":"32","author":"AA Puhalskii","year":"2007","unstructured":"Puhalskii, A.A., Vladimirov, A.A.: A large deviation principle for join the shortest queue. Math. Oper. Res. 32(3), 700\u2013710 (2007)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9556_CR34","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/1520-6750(198706)34:3<381::AID-NAV3220340306>3.0.CO;2-K","volume":"34","author":"BM Rao","year":"1987","unstructured":"Rao, B.M., Posner, M.J.M.: Algorithmic and approximation analyses of the shorter queue model. Naval Res. Logist. NRL 34(3), 381\u2013398 (1987)","journal-title":"Naval Res. Logist. NRL"},{"issue":"3","key":"9556_CR35","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s00186-005-0037-1","volume":"62","author":"A Ridder","year":"2005","unstructured":"Ridder, A., Schwartz, A.: Large deviations without principle: join the shortest queue. Math. Methods Oper. Res. 62(3), 467\u2013483 (2005)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"9556_CR36","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.apm.2007.02.014","volume":"32","author":"AMK Tarabia","year":"2008","unstructured":"Tarabia, A.M.K.: Analysis of two queues in parallel with jockeying and restricted capacities. Appl. Math. Model. 32(5), 802\u2013810 (2008)","journal-title":"Appl. Math. Model."},{"issue":"01","key":"9556_CR37","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1017\/S0021900200015357","volume":"37","author":"SRE Turner","year":"2000","unstructured":"Turner, S.R.E.: A join the shorter queue model in heavy traffic. J. Appl. Probab. 37(01), 212\u2013223 (2000)","journal-title":"J. Appl. Probab."},{"key":"9556_CR38","first-page":"95","volume":"28","author":"SRE Turner","year":"2000","unstructured":"Turner, S.R.E.: Large deviations for join the shorter queue. Fields Inst. Commun. 28, 95\u2013108 (2000)","journal-title":"Fields Inst. Commun."},{"issue":"1\u20132","key":"9556_CR39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/15326349808807467","volume":"14","author":"GJ Houtum Van","year":"1998","unstructured":"Van Houtum, G.J., Zijm, W.H.M., Adan, I.J.B.F., Wessels, J.: Bounds for performance characteristics: a systematic approach via cost structures. Stoch. Models 14(1\u20132), 205\u2013224 (1998)","journal-title":"Stoch. Models"},{"issue":"2","key":"9556_CR40","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1017\/S0021900200005611","volume":"46","author":"JSH Leeuwaarden Van","year":"2009","unstructured":"Van Leeuwaarden, J.S.H., Squillante, M.S., Winands, E.M.M.: Quasi-birth-and-death processes, lattice path counting, and hypergeometric functions. J. Appl. Probab. 46(2), 507\u2013520 (2009)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9556_CR41","first-page":"20","volume":"32","author":"N Vvedenskaya","year":"1996","unstructured":"Vvedenskaya, N., Dobrushin, R., Karpelevich, F.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Peredachi Informatsii 32(1), 20\u201334 (1996)","journal-title":"Probl. Peredachi Informatsii"},{"issue":"02","key":"9556_CR42","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1017\/S0021900200045678","volume":"15","author":"RR Weber","year":"1978","unstructured":"Weber, R.R.: On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15(02), 406\u2013413 (1978)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9556_CR43","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1287\/opre.34.1.55","volume":"34","author":"W Whitt","year":"1986","unstructured":"Whitt, W.: Deciding which queue to join: some counterexamples. Oper. Res. 34(1), 55\u201362 (1986)","journal-title":"Oper. Res."},{"issue":"01","key":"9556_CR44","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1017\/S0021900200104772","volume":"14","author":"W Winston","year":"1977","unstructured":"Winston, W.: Optimality of the shortest line discipline. J. Appl. Probab. 14(01), 181\u2013189 (1977)","journal-title":"J. Appl. Probab."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-017-9556-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9556-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9556-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T05:31:14Z","timestamp":1570253474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-017-9556-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":44,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9556"],"URL":"https:\/\/doi.org\/10.1007\/s11134-017-9556-8","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2017,10,30]]}}}