Metraipolis › archive › dc_681de80085ee
Whittle index approach to multi-server scheduling with convex delay costs and impatient customers — arXiv:2609.19792
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19792
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T03:53:34.452Z
- SHA-256 of the archived text
4eaf7eb5f8c6458e2bf779b8064852f777cf029ff8653bda8993c9204dd3110e- Stable URL of this page
https://metraipolis.com/documento/dc_681de80085ee
How to cite
Whittle index approach to multi-server scheduling with convex delay costs and impatient customers — arXiv:2609.19792 — arXiv (en), https://arxiv.org/abs/2609.19792 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_681de80085ee (Metraipolis archive dc_681de80085ee, sha256 4eaf7eb5f8c6458e2bf779b8064852f777cf029ff8653bda8993c9204dd3110e)
BibTeX
@misc{dc681de80085ee,
title = {Whittle index approach to multi-server scheduling with convex delay costs and impatient customers — arXiv:2609.19792},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19792},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_681de80085ee; sha256 4eaf7eb5f8c6458e2bf779b8064852f777cf029ff8653bda8993c9204dd3110e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19792. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the dynamic scheduling problem in a multi-class M/G/N + M queue with convex delay costs and impatient customers that have exponential abandonment times. We apply the Whittle index approach to find a reasonable heuristic solution for this tricky problem. By assuming exponential abandonment times, we are able to make a very straightforward use of the results of the corresponding problem with patient customers presented in Queueing Systems, Vol. 110, Article no. 2, 2026. Our main theoretical achievements are proving that the closed version of the corresponding discrete-time problem is indexable and deriving an explicit expression for the Whittle index. The discrete-time results are utilized to develop the Whittle index policy for the original continuous-time scheduling problem. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-18 in cs.PF). Categorie arXiv: Performance (cs.PF) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.19792 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T03:24:50.231Z dalla pagina https://arxiv.org/catchup/cs.PF/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).