{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:15:08Z","timestamp":1766268908048,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001852","name":"CEFIPRA","doi-asserted-by":"crossref","award":["5100-IT1"],"award-info":[{"award-number":["5100-IT1"]}],"id":[{"id":"10.13039\/501100001852","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10479-017-2622-0","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T12:00:02Z","timestamp":1504180802000},"page":"417-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Whittle indexability in egalitarian processor sharing systems"],"prefix":"10.1007","volume":"317","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0756-5402","authenticated-orcid":false,"given":"Vivek S.","family":"Borkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7908-8209","authenticated-orcid":false,"given":"Sarath","family":"Pattathil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"key":"2622_CR1","doi-asserted-by":"crossref","unstructured":"Aalto, S., Ayesta, U., Borst, S., Misra, V., & N\u00fanez-Queija, R. (2007). Beyond processor sharing. ACM SIGMETRICS Performance Evaluation Review, 34(4), 36\u201343.","DOI":"10.1145\/1243401.1243409"},{"issue":"6","key":"2622_CR2","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TAC.2008.925856","volume":"53","author":"M Agarwal","year":"2008","unstructured":"Agarwal, M., Borkar, V. S., & Karandikar, A. (2008). Structural properties of optimal transmission policies over a randomly varying channel. IEEE Transactions on Automatic Control, 53(6), 1476\u20131491.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1\u2014-2","key":"2622_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11134-006-7586-8","volume":"53","author":"E Altman","year":"2006","unstructured":"Altman, E., Avrachenkov, K., & Ayesta, U. (2006). A survey on discriminatory processor sharing. Queueing Systems, 53(1\u2014-2), 53\u201363.","journal-title":"Queueing Systems"},{"issue":"1-2","key":"2622_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11235-010-9300-8","volume":"47","author":"E Altman","year":"2011","unstructured":"Altman, E., Ayesta, U., & Prabhu, B. J. (2011). Load balancing in processor sharing systems. Telecommunication Systems, 47(1-2), 35\u201348.","journal-title":"Telecommunication Systems"},{"issue":"4","key":"2622_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1057\/palgrave.jors.2601504","volume":"54","author":"PS Ansell","year":"2003","unstructured":"Ansell, P. S., Glazebrook, K. D., & Kirkbride, C. (2003). Generalized \u2018Join the shortest queue\u2019 policies for the dynamic routing of jobs for multi-class queues. Journal of the Operational Research Society, 54(4), 379\u2013389.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"2622_CR6","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.1070.0505","volume":"57","author":"TW Archibald","year":"2009","unstructured":"Archibald, T. W., Black, D. P., & Glazebrook, K. D. (2009). Indexability and index heuristics for a simple class of inventory routing problems. Operations Research, 57(2), 314\u2013326.","journal-title":"Operations Research"},{"issue":"12","key":"2622_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1017\/S0269964809000138","volume":"23","author":"NT Argon","year":"2009","unstructured":"Argon, N. T., Ding, L., Glazebrook, K. D., & Zia, S. (2009). Dynamic routing of customers with general delay costs in a multiserver queuing system. Probability in the Engineering and Informational Sciences, 23(12), 175\u2013203.","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"2622_CR8","volume-title":"Topics in controlled Markov chains","author":"VS Borkar","year":"1991","unstructured":"Borkar, V. S. (1991). Topics in controlled Markov chains. Harlow: Longman Scientific & Technical."},{"key":"2622_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-1-4615-5223-9_8","volume-title":"System theory: Modeling, analysis and control","author":"VS Borkar","year":"2000","unstructured":"Borkar, V. S. (2000). Uniform stability of controlled Markov processes. In T. E. Djaferis & I. C. Schick (Eds.), System theory: Modeling, analysis and control (pp. 107\u2013120). Norwell, MA: Kluwer Academic."},{"key":"2622_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-1-4615-0805-2_11","volume-title":"Handbook of Markov decision processes","author":"VS Borkar","year":"2002","unstructured":"Borkar, V. S. (2002). Convex analytic methods in Markov decision processes. In A. Shwartz & E. Feinberg (Eds.), Handbook of Markov decision processes (pp. 347\u2013375). Norwell, MA: Kluwer Academic."},{"key":"2622_CR11","doi-asserted-by":"crossref","unstructured":"Borkar, V. S., & Chadha, K. (2018) A reinforcement learning algorithm for restless bandits (submitted).","DOI":"10.1109\/INDIANCC.2018.8307959"},{"key":"2622_CR12","doi-asserted-by":"crossref","unstructured":"Borkar, V. S., Karumanchi, R., & Saboo, K. (2017). An index policy for dynamic pricing in cloud computing under price commitments. Applicationes Mathematicae (to appear).","DOI":"10.4064\/am2313-6-2017"},{"issue":"4","key":"2622_CR13","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1287\/opre.1080.0632","volume":"57","author":"KD Glazebrook","year":"2009","unstructured":"Glazebrook, K. D., Kirkbride, C., & Ouenniche, J. (2009). Index policies for the admission control and routing of impatient customers to homogeneous service stations. Operations Research, 57(4), 975\u2013989.","journal-title":"Operations Research"},{"key":"2622_CR14","volume-title":"Dynamic priority allocation in restless bandit models","author":"P Jacko","year":"2010","unstructured":"Jacko, P. (2010). Dynamic priority allocation in restless bandit models. Saarbr\u00fccken: Lambert Academic Publishing."},{"key":"2622_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3132-0","volume-title":"Markov processes for stochastic modeling","author":"M Kijima","year":"1997","unstructured":"Kijima, M. (1997). Markov processes for stochastic modeling. New York: Springer."},{"issue":"2","key":"2622_CR16","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L Kleinrock","year":"1967","unstructured":"Kleinrock, L. (1967). Time-shared systems: A theoretical treatment. Journal of the ACM, 14(2), 242\u2013261.","journal-title":"Journal of the ACM"},{"issue":"6","key":"2622_CR17","doi-asserted-by":"publisher","first-page":"3812","DOI":"10.1109\/TNET.2016.2562564","volume":"24","author":"M Larran\u00e4ga","year":"2016","unstructured":"Larran\u00e4ga, M., Ayesta, U., & Verloop, I. M. (2016). Dynamic control of birth-and-death restless bandits: Application to resource-allocation problems. IEEE\/ACM Transactions on Networking, 24(6), 3812\u20133825.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2622_CR18","volume-title":"Markov chains and stochastic stability","author":"SP Meyn","year":"2012","unstructured":"Meyn, S. P., & Tweedie, R. L. (2012). Markov chains and stochastic stability (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"issue":"2","key":"2622_CR19","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1111\/1468-0262.00296","volume":"70","author":"P Milgrom","year":"2002","unstructured":"Milgrom, P., & Segal, I. (2002). Envelope theorems for arbitrary choice sets. Econometrica, 70(2), 583\u2013601.","journal-title":"Econometrica"},{"issue":"2","key":"2622_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0167-6911(89)90011-X","volume":"12","author":"P Nain","year":"1989","unstructured":"Nain, P. (1989). Interchange arguments for classical scheduling problems in queues. Systems & Control Letters, 12(2), 177\u2013184.","journal-title":"Systems & Control Letters"},{"key":"2622_CR21","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/3214386","volume":"26","author":"P Nain","year":"1989","unstructured":"Nain, P., Tsoucas, P., & Walrand, J. (1989). Interchange arguments in stochastic scheduling. Journal of Applied Probability, 26, 815\u2013826.","journal-title":"Journal of Applied Probability"},{"key":"2622_CR22","doi-asserted-by":"crossref","unstructured":"Nin\u00f5-Mora, J. (2007a). Marginal productivity index policies for admission control and routing to parallel multi-server loss queues with reneging. In T. Chahed & B. Tuffin (Eds.), Proceedings of the international conference on network control and optimization, June 5\u20137, 2007, Avignon, France, Lecture Notes in Computer Science No. 4465 (pp. 138\u2013149). Berlin: Springer.","DOI":"10.1007\/978-3-540-72709-5_15"},{"key":"2622_CR23","doi-asserted-by":"crossref","unstructured":"Nin\u00f5-Mora, J. (2007b). Characterization and computation of restless bandit marginal productivity indices. In Proceedings of the 2nd international conference on Performance evaluation methodologies and tools. Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST).","DOI":"10.4108\/smctools.2007.1993"},{"issue":"3","key":"2622_CR24","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.ejor.2012.02.033","volume":"220","author":"J Nin\u00f5-Mora","year":"2012","unstructured":"Nin\u00f5-Mora, J. (2012a). Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies. European Journal of Operational Research, 220(3), 705\u2013720.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"2622_CR25","doi-asserted-by":"publisher","first-page":"3431","DOI":"10.1016\/j.cor.2012.05.004","volume":"39","author":"J Nin\u00f5-Mora","year":"2012","unstructured":"Nin\u00f5-Mora, J. (2012b). Admission and routing of soft real-time jobs to multi-clusters: Design and comparison of index policies. Computers & Operations Research, 39(12), 3431\u20133444.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2622_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/moor.24.2.293","volume":"24","author":"CH Papadimitriou","year":"1999","unstructured":"Papadimitriou, C. H., & Tsitsiklis, J. N. (1999). The complexity of optimal queuing network control. Mathematics of Operations Research, 24(2), 293\u2013305.","journal-title":"Mathematics of Operations Research"},{"key":"2622_CR27","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M. L. (2014). Markov decision processes: discrete stochastic dynamic programming. New York: Wiley."},{"issue":"1","key":"2622_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00939913","volume":"75","author":"R Sznajder","year":"1992","unstructured":"Sznajder, R., & Filar, J. A. (1992). Some comments on a theorem of Hardy and Littlewood. Journal of Optimization Theory and Applications, 75(1), 201\u2013208.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2622_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P Whittle","year":"1988","unstructured":"Whittle, P. (1988). Restless bandits: Activity allocation in a changing world. Journal of Applied Probability, 25, 287\u2013298.","journal-title":"Journal of Applied Probability"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2622-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-017-2622-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2622-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T13:43:48Z","timestamp":1667310228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-017-2622-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2622"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2622-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2017,8,31]]},"assertion":[{"value":"31 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}