{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:10Z","timestamp":1740108250289,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["GRF-16501015","GRF-16201417"],"award-info":[{"award-number":["GRF-16501015","GRF-16201417"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00186-019-00683-9","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T06:19:39Z","timestamp":1570515579000},"page":"399-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Virtual allocation policies for many-server queues with abandonment"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2925-375X","authenticated-orcid":false,"given":"Zhenghua","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"issue":"1","key":"683_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11134-012-9326-6","volume":"74","author":"B Ata","year":"2013","unstructured":"Ata B, Tongarlak MH (2013) On scheduling a multiclass queue with abandonments under general delay costs. Queueing Syst 74(1):65\u2013104","journal-title":"Queueing Syst"},{"issue":"4","key":"683_CR2","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.1214\/105051605000000601","volume":"15","author":"R Atar","year":"2005","unstructured":"Atar R (2005) Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann Appl Probab 15(4):2606\u20132650","journal-title":"Ann Appl Probab"},{"issue":"3","key":"683_CR3","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1214\/105051604000000233","volume":"14","author":"R Atar","year":"2004","unstructured":"Atar R, Mandelbaum A, Reiman MI (2004) Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic. Ann Appl Probab 14(3):1084\u20131134","journal-title":"Ann Appl Probab"},{"issue":"5","key":"683_CR4","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1287\/opre.1100.0826","volume":"58","author":"R Atar","year":"2010","unstructured":"Atar R, Giat C, Shimkin N (2010) The $$c\\mu \/\\theta $$ rule for many server queues with abandonment. Oper Res 58(5):1427\u20131439","journal-title":"Oper Res"},{"issue":"2","key":"683_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s11134-010-9206-x","volume":"67","author":"R Atar","year":"2011","unstructured":"Atar R, Giat C, Shimkin N (2011) On the asymptotic optimality of the $$c\\mu \/\\theta $$ rule under ergodic cost. Queueing Syst 67(2):127\u2013144","journal-title":"Queueing Syst"},{"issue":"3","key":"683_CR6","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1287\/moor.2013.0630","volume":"39","author":"R Atar","year":"2014","unstructured":"Atar R, Kaspi H, Shimkin N (2014) Fluid limits for many-server systems with reneging under a priority policy. Math Oper Res 39(3):672\u2013696","journal-title":"Math Oper Res"},{"issue":"5","key":"683_CR7","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1287\/opre.1100.0815","volume":"58","author":"A Bassamboo","year":"2010","unstructured":"Bassamboo A, Randhawa RS (2010) On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers. Oper Res 58(5):1398\u20131413","journal-title":"Oper Res"},{"key":"683_CR8","doi-asserted-by":"crossref","unstructured":"Bassamboo A, Randhawa RS (2013) Using estimated patience levels to optimally schedule customers. Technical report, Northwestern University and USC","DOI":"10.2139\/ssrn.2312643"},{"issue":"7","key":"683_CR9","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1287\/mnsc.2015.2241","volume":"62","author":"A Bassamboo","year":"2016","unstructured":"Bassamboo A, Randhawa RS (2016) Scheduling homogeneous impatient customers. Manag Sci 62(7):2129\u20132147","journal-title":"Manag Sci"},{"issue":"3","key":"683_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.1060.0285","volume":"54","author":"A Bassamboo","year":"2006","unstructured":"Bassamboo A, Harrison JM, Zeevi A (2006) Design and control of a large call center: asymptotic analysis of an lp-based method. Oper Res 54(3):419\u2013435","journal-title":"Oper Res"},{"key":"683_CR11","series-title":"Wiley series in probability and statistics: probability and statistics","volume-title":"Convergence of probability measures","author":"P Billingsley","year":"1968","unstructured":"Billingsley P (1968) Convergence of probability measures. Wiley series in probability and statistics: probability and statistics. Wiley, New York"},{"key":"683_CR12","series-title":"Wiley series in probability and statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316962","volume-title":"Convergence of probability measures","author":"P Billingsley","year":"1999","unstructured":"Billingsley P (1999) Convergence of probability measures, 2nd edn. Wiley series in probability and statistics. Wiley, New York","edition":"2"},{"key":"683_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1214\/aop\/1176994773","volume":"8","author":"M Brown","year":"1980","unstructured":"Brown M (1980) Bounds, inequalities, and monotonicity properties for some specialized renewal processes. Ann Probab 8:227\u2013240","journal-title":"Ann Probab"},{"issue":"2","key":"683_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s11134-008-9078-5","volume":"59","author":"JG Dai","year":"2008","unstructured":"Dai JG, Tezcan T (2008) Optimal control of parallel server systems with many servers in heavy traffic. Queueing Syst 59(2):95\u2013134","journal-title":"Queueing Syst"},{"issue":"1","key":"683_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1140001","volume":"40","author":"JG Dai","year":"1996","unstructured":"Dai JG, Williams RJ (1996) Existence and uniqueness of semimartingale reflecting brownian motions in convex polyhedrons. Theory Probab Appl 40(1):1\u201340","journal-title":"Theory Probab Appl"},{"key":"683_CR16","series-title":"Wiley series in probability and statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9781118165904","volume-title":"A weak convergence approach to the theory of large deviations","author":"P Dupuis","year":"1997","unstructured":"Dupuis P, Ellis RS (1997) A weak convergence approach to the theory of large deviations. Wiley series in probability and statistics. Wiley, New York"},{"key":"683_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: theory and examples","author":"R Durrett","year":"2010","unstructured":"Durrett R (2010) Probability: theory and examples, 4th edn. Cambridge University Press, Cambridge","edition":"4"},{"key":"683_CR18","series-title":"Wiley series in probability and mathematical statistics: probability and mathematical statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316658","volume-title":"Markov processes","author":"SN Ethier","year":"1986","unstructured":"Ethier SN, Kurtz TG (1986) Markov processes. Wiley series in probability and mathematical statistics: probability and mathematical statistics. Wiley, New York"},{"key":"683_CR19","volume-title":"An introduction to probability theory and its applications","author":"W Feller","year":"1971","unstructured":"Feller W (1971) An introduction to probability theory and its applications, vol II, 2nd edn. Wiley, New York","edition":"2"},{"issue":"2","key":"683_CR20","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/moor.1080.0366","volume":"34","author":"I Gurvich","year":"2009","unstructured":"Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math Oper Res 34(2):363\u2013396","journal-title":"Math Oper Res"},{"issue":"3","key":"683_CR21","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/opre.29.3.567","volume":"29","author":"S Halfin","year":"1981","unstructured":"Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper Res 29(3):567\u2013588","journal-title":"Oper Res"},{"issue":"4","key":"683_CR22","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1019188531950","volume":"33","author":"JM Harrison","year":"1999","unstructured":"Harrison JM, L\u00f3pez MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Syst 33(4):339\u2013368","journal-title":"Queueing Syst"},{"key":"683_CR23","volume-title":"Real and abstract analysis","author":"E Hewitt","year":"1975","unstructured":"Hewitt E, Stromberg K (1975) Real and abstract analysis. Springer, New York"},{"key":"683_CR24","volume-title":"Random measures","author":"O Kallenberg","year":"1986","unstructured":"Kallenberg O (1986) Random measures, 4th edn. Akademie-Verlag, Berlin","edition":"4"},{"issue":"6","key":"683_CR25","doi-asserted-by":"publisher","first-page":"2204","DOI":"10.1214\/10-AAP683","volume":"20","author":"W Kang","year":"2010","unstructured":"Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann Appl Probab 20(6):2204\u20132260","journal-title":"Ann Appl Probab"},{"key":"683_CR26","volume-title":"A first course in stochastic processes","author":"S Karlin","year":"1975","unstructured":"Karlin S, Taylor HM (1975) A first course in stochastic processes, 2nd edn. Academic Press Inc., New York","edition":"2"},{"issue":"1","key":"683_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1214\/09-AAP662","volume":"21","author":"H Kaspi","year":"2011","unstructured":"Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann Appl Probab 21(1):33\u2013114","journal-title":"Ann Appl Probab"},{"issue":"2\u20134","key":"683_CR28","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11134-012-9325-7","volume":"75","author":"J Kim","year":"2013","unstructured":"Kim J, Ward AR (2013) Dynamic scheduling of a $$GI\/GI\/1 + GI$$ queue with multiple customer classes. Queueing Syst 75(2\u20134):339\u2013384","journal-title":"Queueing Syst"},{"issue":"4","key":"683_CR29","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s11134-012-9291-0","volume":"71","author":"Y Liu","year":"2012","unstructured":"Liu Y, Whitt W (2012a) The $$G_t \/GI\/s_t +GI$$ many-server fluid queue. Queueing Syst 71(4):405\u2013444","journal-title":"Queueing Syst"},{"issue":"5","key":"683_CR30","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.orl.2012.05.010","volume":"40","author":"Y Liu","year":"2012","unstructured":"Liu Y, Whitt W (2012b) A many-server fluid limit for the queueing model experiencing periods of overloading. Oper Res Lett 40(5):307\u2013312","journal-title":"Oper Res Lett"},{"issue":"6\u20137","key":"683_CR31","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.orl.2014.06.011","volume":"42","author":"Z Long","year":"2014","unstructured":"Long Z, Zhang J (2014) Convergence to equilibrium states for fluid models of many-server queues with abandonment. Oper Res Lett 42(6\u20137):388\u2013393","journal-title":"Oper Res Lett"},{"issue":"3","key":"683_CR32","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S0269964818000232","volume":"33","author":"Z Long","year":"2019","unstructured":"Long Z, Zhang J (2019) A note on many-server fluid models with time-varying arrivals. Probab Eng Inf Sci 33(3):417\u2013437","journal-title":"Probab Eng Inf Sci"},{"issue":"6","key":"683_CR33","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.1040.0152","volume":"52","author":"A Mandelbaum","year":"2004","unstructured":"Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: heavy-traffic optimality of the generalized $$c\\mu $$-rule. Oper Res 52(6):836\u2013855","journal-title":"Oper Res"},{"issue":"1\/2","key":"683_CR34","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1019112920622","volume":"30","author":"A Mandelbaum","year":"1998","unstructured":"Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for markovian service networks. Queueing Syst 30(1\/2):149\u2013201","journal-title":"Queueing Syst"},{"issue":"5","key":"683_CR35","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1287\/opre.1110.0985","volume":"59","author":"O Perry","year":"2011","unstructured":"Perry O, Whitt W (2011) A fluid approximation for service systems responding to unexpected overloads. Oper Res 59(5):1159\u20131170","journal-title":"Oper Res"},{"issue":"4","key":"683_CR36","doi-asserted-by":"publisher","first-page":"932","DOI":"10.2307\/3214725","volume":"29","author":"M Shaked","year":"1992","unstructured":"Shaked M, Zhu H (1992) Some results on block replacement policies and renewal theory. J Appl Probab 29(4):932\u2013946","journal-title":"J Appl Probab"},{"issue":"3","key":"683_CR37","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1214\/aoap\/1177004706","volume":"5","author":"JA van Mieghem","year":"1995","unstructured":"van Mieghem JA (1995) Dynamic scheduling with convex delay costs: the generalized $$c\\mu $$ rule. Ann Appl Probab 5(3):809\u2013833","journal-title":"Ann Appl Probab"},{"issue":"10","key":"683_CR38","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1287\/mnsc.1040.0279","volume":"50","author":"W Whitt","year":"2004","unstructured":"Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Manag Sci 50(10):1449\u20131461","journal-title":"Manag Sci"},{"issue":"1","key":"683_CR39","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.1050.0227","volume":"54","author":"W Whitt","year":"2006","unstructured":"Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper Res 54(1):37\u201354","journal-title":"Oper Res"},{"issue":"2","key":"683_CR40","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11134-012-9307-9","volume":"73","author":"J Zhang","year":"2013","unstructured":"Zhang J (2013) Fluid models of many-server queues with abandonment. Queueing Syst 73(2):147\u2013193","journal-title":"Queueing Syst"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-019-00683-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:08:23Z","timestamp":1602025703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-019-00683-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["683"],"URL":"https:\/\/doi.org\/10.1007\/s00186-019-00683-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"7 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}