{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:03:18Z","timestamp":1774987398508,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002666","name":"Aalto University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002666","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We consider the dynamic scheduling problem in a multi-server queue with Poisson arrivals, independent service times, and multiple customer classes with convex delay costs. This problem was already studied by van Mieghem\u00a0(Ann Appl Probab 5:808\u2013833, 1995) in his seminal paper. He launched the generalized\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$c\\mu $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>c<\/mml:mi>\n                            <mml:mi>\u03bc<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    rule and proved its asymptotic optimality in the heavy traffic limit for a single-server system. Mandelbaum and Stolyar\u00a0(Oper Res 52:836\u2013855, 2004) generalized this asymptotic result for multi-server systems. While the generalized\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$c\\mu $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>c<\/mml:mi>\n                            <mml:mi>\u03bc<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    rule is a near-optimal scheduling policy under heavy traffic, it can still be improved in normal traffic conditions. This was demonstrated in Aalto\u00a0(Math Methods Oper Res 100:603\u2013634, 2024), where we applied the Whittle index approach to develop an index policy for the dynamic scheduling problem assuming IHR service times. In this paper, we continue applying the Whittle index approach, and our aim is to get rid of the restrictive IHR assumption mentioned above. As the main theoretical contribution, we prove that the corresponding discrete-time problem with discounted costs is indexable even for non-IHR service time distributions. In addition, we give an explicit characterization of the corresponding Whittle index. By utilizing the discrete-time results, we develop a novel index policy for the original continuous-time dynamic scheduling problem. The performance of the developed Whittle index policy for convex delay costs is studied by numerical simulations. In this numerical study, we demonstrate that the Whittle index policy performs systematically better than the generalized\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$c\\mu $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>c<\/mml:mi>\n                            <mml:mi>\u03bc<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    rule and the other scheduling policies included in the comparison. The numerical results also hint that applying the developed Whittle index policy is most efficient in single-server systems with customers that have highly varying service times.\n                  <\/jats:p>","DOI":"10.1007\/s11134-025-09961-2","type":"journal-article","created":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T08:34:40Z","timestamp":1765182880000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic scheduling with convex delay costs revisited"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1040-4095","authenticated-orcid":false,"given":"Samuli","family":"Aalto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"9961_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11134-024-09902-5","volume":"107","author":"S Aalto","year":"2024","unstructured":"Aalto, S.: Whittle index approach to multiserver scheduling with impatient customers and DHR service times. Queueing Syst. 107, 1\u201330 (2024)","journal-title":"Queueing Syst."},{"key":"9961_CR2","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00186-024-00877-w","volume":"100","author":"S Aalto","year":"2024","unstructured":"Aalto, S.: Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times. Math. Methods Oper. Res. 100, 603\u2013634 (2024)","journal-title":"Math. Methods Oper. Res."},{"key":"9961_CR3","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":"9961_CR4","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. Probab. Eng. Inf. Sci. 25, 269\u2013288 (2011)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"9961_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11134-016-9484-z","volume":"83","author":"S Aalto","year":"2016","unstructured":"Aalto, S., Lassila, P., Osti, P.: Whittle index approach to size-aware scheduling for time-varying channels with multiple states. Queueing Syst. 83, 195\u2013225 (2016)","journal-title":"Queueing Syst."},{"key":"9961_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.peva.2017.03.005","volume":"112","author":"S Aalto","year":"2017","unstructured":"Aalto, S., Lassila, P., Osti, P.: Opportunistic scheduling with flow size information for Markovian time-varying channels. Perform. Eval. 112, 27\u201352 (2017)","journal-title":"Perform. Eval."},{"key":"9961_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2019.102052","volume":"136","author":"S Aalto","year":"2019","unstructured":"Aalto, S., Lassila, P., Taboada, I.: Whittle index approach to opportunistic scheduling with partial channel information. Perform. Eval. 136, 102052 (2019)","journal-title":"Perform. Eval."},{"key":"9961_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/3179418","volume":"2","author":"A Anand","year":"2018","unstructured":"Anand, A., de Veciana, G.: A Whittle\u2019s index based approach for QoE optimization in wireless networks. Proc. ACM Meas. Anal. Comput. Syst. 2, 15 (2018)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"9961_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s001860200257","volume":"57","author":"PS Ansell","year":"2003","unstructured":"Ansell, P.S., Glazebrook, K.D., Ni\u00f1o-Mora, J., O\u2019Keeffe, M.: Whittle\u2019s index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57, 21\u201339 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"9961_CR10","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.peva.2010.08.015","volume":"67","author":"U Ayesta","year":"2010","unstructured":"Ayesta, U., Erausquin, M., Jacko, P.: A modeling framework for optimizing the flow-level scheduling with time-varying channels. Perform. Eval. 67, 1014\u20131029 (2010)","journal-title":"Perform. Eval."},{"key":"9961_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10951-015-0456-7","volume":"20","author":"U Ayesta","year":"2017","unstructured":"Ayesta, U., Jacko, P., Novak, V.: Scheduling of multi-class multi-server queueing systems with abandonments. J. Sched. 20, 129\u2013145 (2017)","journal-title":"J. Sched."},{"key":"9961_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.peva.2016.02.002","volume":"99\u2013100","author":"F Cecchi","year":"2016","unstructured":"Cecchi, F., Jacko, P.: Nearly-optimal scheduling of users with Markovian time-varying transmission rates. Perform. Eval. 99\u2013100, 16\u201336 (2016)","journal-title":"Perform. Eval."},{"key":"9961_CR13","unstructured":"Cox, D.R., Smith, W.L.: Queues. Methuen (1961)"},{"key":"9961_CR14","unstructured":"Gittins, J.C.: Multi-armed Bandit Allocation Indices. Wiley (1989)"},{"key":"9961_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1026060405346","volume":"45","author":"KD Glazebrook","year":"2003","unstructured":"Glazebrook, K.D., Lumley, R.R., Ansell, P.S.: Index heuristics for multiclass M\/G\/1 systems with non-preemptive service and convex holding costs. Queueing Syst. 45, 81\u2013111 (2003)","journal-title":"Queueing Syst."},{"key":"9961_CR16","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.peva.2011.07.012","volume":"68","author":"P Jacko","year":"2011","unstructured":"Jacko, P.: Value of information in optimal flow-level scheduling of users with Markovian time-varying channels. Perform. Eval. 68, 1022\u20131036 (2011)","journal-title":"Perform. Eval."},{"key":"9961_CR17","doi-asserted-by":"publisher","first-page":"3812","DOI":"10.1109\/TNET.2016.2562564","volume":"24","author":"M Larra\u00f1aga","year":"2016","unstructured":"Larra\u00f1aga, M., Ayesta, U., Verloop, I.M.: Dynamic control of birth-and-death restless bandits: application to resource-allocation problems. IEEE\/ACM Trans. Netw. 24, 3812\u20133825 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9961_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s11134-015-9445-y","volume":"81","author":"M Larra\u00f1aga","year":"2015","unstructured":"Larra\u00f1aga, M., Ayesta, U., Verloop, I.M.: Asymptotically optimal index policies for an abandonment queue with convex holding cost. Queueing Syst. 81, 99\u2013169 (2015)","journal-title":"Queueing Syst."},{"key":"9961_CR19","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.1040.0152","volume":"52","author":"A Mandelbaum","year":"2004","unstructured":"Mandelbaum, A., Stolyar, S.: Scheduling flexible servers with convex delay costs: heavy-traffic optimality of the generalized $$c\\mu $$-rule. Oper. Res. 52, 836\u2013855 (2004)","journal-title":"Oper. Res."},{"key":"9961_CR20","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.3390\/math11071639","volume":"11","author":"J Ni\u00f1o-Mora","year":"2023","unstructured":"Ni\u00f1o-Mora, J.: Markovian restless bandits and index policies: a review. Mathematics 11, 1639 (2023)","journal-title":"Mathematics"},{"key":"9961_CR21","unstructured":"Ross, S.M.: Applied Probability Models with Optimization Applications. Holden-Day (1970)"},{"key":"9961_CR22","doi-asserted-by":"crossref","unstructured":"Scully, Z., Harchol-Balter, M.: The Gittins policy in the M\/G\/1 queue. In: Proceedings of WiOpt (2021)","DOI":"10.23919\/WiOpt52861.2021.9589051"},{"key":"9961_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.peva.2017.09.007","volume":"117","author":"I Taboada","year":"2017","unstructured":"Taboada, I., Liberal, F., Fajardo, J., Blanco, B.: An index rule proposal for scheduling in mobile broadband networks with limited channel feedback. Perform. Eval. 117, 130\u2013142 (2017)","journal-title":"Perform. Eval."},{"key":"9961_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.peva.2014.07.006","volume":"79","author":"I Taboada","year":"2014","unstructured":"Taboada, I., Liberal, F., Jacko, P.: An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels. Perform. Eval. 79, 90\u2013103 (2014)","journal-title":"Perform. Eval."},{"key":"9961_CR25","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1214\/aoap\/1177004706","volume":"5","author":"JA van Mieghem","year":"1995","unstructured":"van Mieghem, J.A.: Dynamic scheduling with convex delay costs: the generalized $$c\\mu $$ rule. Ann. Appl. Probab. 5, 808\u2013833 (1995)","journal-title":"Ann. Appl. Probab."},{"key":"9961_CR26","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1214\/15-AAP1137","volume":"26","author":"IM Verloop","year":"2016","unstructured":"Verloop, I.M.: Asymptotically optimal priority policies for indexable and non-indexable restless bandits. Ann. Appl. Probab. 26, 1947\u20131995 (2016)","journal-title":"Ann. Appl. Probab."},{"key":"9961_CR27","doi-asserted-by":"publisher","first-page":"4997","DOI":"10.1109\/TWC.2019.2931690","volume":"18","author":"K Wang","year":"2019","unstructured":"Wang, K., Yu, J., Chen, L., Win, M.: Opportunistic scheduling revisited using restless bandits: indexability and index policy. IEEE Trans. Wirel. Commun. 18, 4997\u20135010 (2019)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"9961_CR28","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/3214547","volume":"27","author":"R Weber","year":"1990","unstructured":"Weber, R., Weiss, G.: On an index policy for restless bandits. J. Appl. Probab. 27, 637\u2013648 (1990)","journal-title":"J. Appl. Probab."},{"key":"9961_CR29","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1214\/aop\/1176994469","volume":"9","author":"P Whittle","year":"1981","unstructured":"Whittle, P.: Arm-acquiring bandits. Ann. Probab. 9, 284\u2013292 (1981)","journal-title":"Ann. Probab."},{"key":"9961_CR30","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25A","author":"P Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: activity allocation in a changing world. J. Appl. Probab. 25A, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-025-09961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-025-09961-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-025-09961-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:20:39Z","timestamp":1774984839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-025-09961-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9961"],"URL":"https:\/\/doi.org\/10.1007\/s11134-025-09961-2","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"29 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}