{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T13:33:21Z","timestamp":1694612001207},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11134-022-09777-4","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T13:05:38Z","timestamp":1648472738000},"page":"373-375","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing the mean slowdown in a single-server queue"],"prefix":"10.1007","volume":"100","author":[{"given":"Samuli","family":"Aalto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"9777_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s11134-009-9141-x","volume":"63","author":"S Aalto","year":"2009","unstructured":"Aalto, S., Ayesta, U., Righter, R.: On the Gittins index in the M\/G\/1 queue. Queueing Syst. 63, 437\u2013458 (2009)","journal-title":"Queueing Syst."},{"key":"9777_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0269964811000015","volume":"25","author":"S Aalto","year":"2011","unstructured":"Aalto, S., Ayesta, U., Righter, R.: Properties of the Gittins index with application to optimal scheduling. Prob. Eng. Info. Sci. 25, 269\u2013288 (2011)","journal-title":"Prob. Eng. Info. Sci."},{"key":"9777_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00453-004-1115-0","volume":"40","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Dhamdhere, K., K\u00f6nemann, J., Sinha, A.: Non-clairvoyant scheduling for minimizing mean slowdown. Algorithmica 40, 305\u2013318 (2004)","journal-title":"Algorithmica"},{"key":"9777_CR4","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Leonardi, S.: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In: Proc. of ACM STOC, pages 94\u2013103, (2001)","DOI":"10.1145\/380752.380782"},{"issue":"2","key":"9777_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/959143.959165","volume":"31","author":"H Feng","year":"2003","unstructured":"Feng, H., Misra, V.: Mixed scheduling disciplines for network flows. ACM Sigmetr. Perform. Eval. Rev. 31(2), 36\u201339 (2003)","journal-title":"ACM Sigmetr. Perform. Eval. Rev."},{"key":"9777_CR6","doi-asserted-by":"crossref","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices. Wiley, second edition, (2011)","DOI":"10.1002\/9780470980033"},{"key":"9777_CR7","unstructured":"Gittins, J.\u00a0C.: Multi-armed Bandit Allocation Indices. Wiley, (1989)"},{"key":"9777_CR8","doi-asserted-by":"crossref","unstructured":"Hyyti\u00e4, E., Aalto, S., Penttinen, A.: Minimizing slowdown in heterogeneous size-aware dispatching systems. In: Proc. of ACM Sigmetrics\/Performance, pages 29\u201340, (2012)","DOI":"10.1145\/2318857.2254763"},{"key":"9777_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.peva.2007.06.028","volume":"65","author":"M Nuyens","year":"2004","unstructured":"Nuyens, M., Wierman, A.: The foreground-background queue: A survey. Perform. Eval. 65, 286\u2013307 (2004)","journal-title":"Perform. Eval."},{"key":"9777_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"LE Schrage","year":"1968","unstructured":"Schrage, L.E.: A proof of the optimality of the shortest remaining processing time discipline. Op. Res. 16, 687\u2013690 (1968)","journal-title":"Op. Res."},{"key":"9777_CR11","doi-asserted-by":"crossref","unstructured":"Scully, Z., Harchol-Balter, M.: The Gittins policy in the M\/G\/1 queue. In: Proc. of WiOpt, (2021)","DOI":"10.23919\/WiOpt52861.2021.9589051"},{"key":"9777_CR12","doi-asserted-by":"crossref","unstructured":"Wierman, A., Harchol-Balter, M., Osogami, T.: Nearly insensitive bounds for SMART scheduling. In: Proc. of ACM Sigmetrics, pages 205\u2013216, (2005)","DOI":"10.1145\/1071690.1064236"},{"key":"9777_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TNET.2004.826280","volume":"12","author":"SJ Yang","year":"2004","unstructured":"Yang, S.J., de Veciana, G.: Enhancing both network and user performance for networks supporting Best Effort traffic. IEEE\/ACM Trans. Netw. 12, 349\u2013360 (2004)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-022-09777-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-022-09777-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-022-09777-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T11:25:13Z","timestamp":1654169113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-022-09777-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9777"],"URL":"https:\/\/doi.org\/10.1007\/s11134-022-09777-4","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"4 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}