{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:25:33Z","timestamp":1774599933666,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2009,9,24]],"date-time":"2009-09-24T00:00:00Z","timestamp":1253750400000},"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":[[2009,12]]},"DOI":"10.1007\/s11134-009-9141-x","type":"journal-article","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:22:43Z","timestamp":1253712163000},"page":"437-458","source":"Crossref","is-referenced-by-count":55,"title":["On the Gittins index in the M\/G\/1 queue"],"prefix":"10.1007","volume":"63","author":[{"given":"Samuli","family":"Aalto","sequence":"first","affiliation":[]},{"given":"Urtzi","family":"Ayesta","sequence":"additional","affiliation":[]},{"given":"Rhonda","family":"Righter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,24]]},"reference":[{"key":"9141_CR1","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1239\/jap\/1152413739","volume":"43","author":"S. Aalto","year":"2006","unstructured":"Aalto, S., Ayesta, U.: On the nonoptimality of the foreground-background discipline for IMRL service times. J. Appl. Probab. 43, 523\u2013534 (2006)","journal-title":"J. Appl. Probab."},{"key":"9141_CR2","doi-asserted-by":"crossref","unstructured":"Aalto, S., Ayesta, U.: Optimal scheduling of jobs with a DHR tail in the M\/G\/1 queue. In: Proceedings of ValueTools 2008, Athens, Greece (2008)","DOI":"10.4108\/ICST.VALUETOOLS2008.4335"},{"key":"9141_CR3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/opre.48.1.80.12444","volume":"48","author":"D. Bertsimas","year":"2000","unstructured":"Bertsimas, D., Nino-Mora, J.: Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Oper. Res. 48, 80\u201390 (2000)","journal-title":"Oper. Res."},{"key":"9141_CR4","volume-title":"Analysis and Synthesis of Computer Systems","author":"E. Gelenbe","year":"1980","unstructured":"Gelenbe, E., Mitrani, I.: Analysis and Synthesis of Computer Systems. Academic Press, London (1980)"},{"key":"9141_CR5","volume-title":"Multi-armed Bandit Allocation Indices","author":"J.C. Gittins","year":"1989","unstructured":"Gittins, J.C.: Multi-armed Bandit Allocation Indices. Wiley, Chichester (1989)"},{"key":"9141_CR6","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L.: Queueing Systems, vol. 2. Wiley, New York (1976)"},{"key":"9141_CR7","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1137\/1119060","volume":"19","author":"G.P. Klimov","year":"1974","unstructured":"Klimov, G.P.: Time-sharing service systems.\u00a0I. Theory Probab. Appl. 19, 532\u2013551 (1974)","journal-title":"Theory Probab. Appl."},{"key":"9141_CR8","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/1123034","volume":"23","author":"G.P. Klimov","year":"1978","unstructured":"Klimov, G.P.: Time-sharing service systems.\u00a0II. Theory Probab. Appl. 23, 314\u2013321 (1978)","journal-title":"Theory Probab. Appl."},{"key":"9141_CR9","volume-title":"Stochastic Ageing and Dependence for Reliability","author":"C.-D. Lai","year":"2006","unstructured":"Lai, C.-D., Xie, M.: Stochastic Ageing and Dependence for Reliability. Springer, New York (2006)"},{"key":"9141_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-4149(77)90029-1","volume":"5","author":"I. Meilijson","year":"1977","unstructured":"Meilijson, I., Weiss, G.: Multiple feedback at a single server station. Stoch. Process. Appl. 5, 195\u2013205 (1977)","journal-title":"Stoch. Process. Appl."},{"key":"9141_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-4149(77)90014-X","volume":"6","author":"I. Meilijson","year":"1977","unstructured":"Meilijson, I., Yechiali, U.: On optimal right-of-way policies at a single server station when insertion of idle times is permitted. Stoch. Process. Appl. 6, 25\u201332 (1977)","journal-title":"Stoch. Process. Appl."},{"key":"9141_CR12","unstructured":"Osipova, N., Ayesta, U., Avrachenkov, K.E.: Optimal policy for multi-class scheduling in a single server queue. In: Proceedings of ITC-21 (2009)"},{"key":"9141_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0269964800001194","volume":"3","author":"R. Righter","year":"1989","unstructured":"Righter, R., Shanthikumar, J.G.: Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probab. Eng. Inf. Sci. 3, 323\u2013334 (1989)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"9141_CR14","doi-asserted-by":"crossref","first-page":"967","DOI":"10.2307\/3214728","volume":"29","author":"R. Righter","year":"1992","unstructured":"Righter, R., Shanthikumar, J.G.: Extremal properties of the FIFO discipline in queueing networks. J.\u00a0Appl. Probab. 29, 967\u2013978 (1992)","journal-title":"J.\u00a0Appl. Probab."},{"key":"9141_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.2307\/3214660","volume":"27","author":"R. Righter","year":"1990","unstructured":"Righter, R., Shanthikumar, J.G., Yamazaki, G.: On extremal service disciplines in single-stage queueing systems. J. Appl. Probab. 27, 409\u2013416 (1990)","journal-title":"J. Appl. Probab."},{"issue":"3","key":"9141_CR16","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L.E. Schrage","year":"1968","unstructured":"Schrage, L.E.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3), 687\u2013690 (1968)","journal-title":"Oper. Res."},{"key":"9141_CR17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/321796.321803","volume":"21","author":"K. Sevcik","year":"1974","unstructured":"Sevcik, K.: Scheduling for minimum total loss using service time distributions. J. ACM 21, 66\u201375 (1974)","journal-title":"J. ACM"},{"key":"9141_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-34675-5","volume-title":"Stochastic Orders","author":"M. Shaked","year":"2007","unstructured":"Shaked, M., Shanthikumar, J.G.: Stochastic Orders. Springer, New York (2007)"},{"key":"9141_CR19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"D.R. Smith","year":"1978","unstructured":"Smith, D.R.: A new proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 26, 197\u2013199 (1978)","journal-title":"Oper. Res."},{"key":"9141_CR20","doi-asserted-by":"crossref","unstructured":"Tsitsiklis, J.N.: A short proof of the Gittins index theorem. In: IEEE CDC, pp.\u00a0389\u2013390 (1993)","DOI":"10.1109\/CDC.1993.325122"},{"key":"9141_CR21","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/TAC.1985.1103989","volume":"30","author":"P. Varaiya","year":"1985","unstructured":"Varaiya, P., Walrand, J., Buyukkoc, C.: Extensions of the multiarmed bandit problem: the discounted case. IEEE Trans. Autom. Control 30, 426\u2013439 (1985)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"9141_CR22","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1214\/aoap\/1177005588","volume":"2","author":"R. Weber","year":"1992","unstructured":"Weber, R.: On the Gittins index for multiarmed bandits. Ann. Appl. Probab. 2(4), 1024\u20131033 (1992)","journal-title":"Ann. Appl. Probab."},{"key":"9141_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P. Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: Activity allocation in a changing world. J. Appl. Probab. 25, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."},{"key":"9141_CR24","first-page":"51","volume":"2","author":"S.F. Yashkov","year":"1978","unstructured":"Yashkov, S.F.: On feedback sharing a processor among jobs with minimal serviced length (in Russian). Tech. Sreds. Svyazi, Ser. ASU 2, 51\u201362 (1978)","journal-title":"Tech. Sreds. Svyazi, Ser. ASU"},{"key":"9141_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S.F. Yashkov","year":"1987","unstructured":"Yashkov, S.F.: Processor sharing queues: Some progress in analysis. Queueing Syst. 2, 1\u201317 (1987)","journal-title":"Queueing Syst."},{"key":"9141_CR26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01097426","volume":"58","author":"S.F. Yashkov","year":"1992","unstructured":"Yashkov, S.F.: Mathematical problems in the theory of processor sharing queueing systems. J. Sov. Math. 58, 101\u2013147 (1992)","journal-title":"J. Sov. Math."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9141-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-009-9141-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9141-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:39Z","timestamp":1559360679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-009-9141-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,24]]},"references-count":26,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9141"],"URL":"https:\/\/doi.org\/10.1007\/s11134-009-9141-x","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,24]]}}}