Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm
Operations Research · 2026-07 · 74 (4) · 2161-2178
DOI: 10.1287/opre.2024.1061 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research, 2026-07. Verfasst von Nils Charlet und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
Many systems traditionally use a basic first-come, first-served scheduling policy. It is simple to implement and perceived as fair to arriving jobs. In recent years, Nudge policies were introduced, showing that large delays occur less frequently by allowing small changes in the order in which jobs are served—often improving all delay quantiles. In “Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm,” Charlet and Van Houdt introduce the Nudge*(M) policy and show that this policy is optimal among a broad class of Nudge-like policies. A key feature of these policies is that they do not exploit arrival time information, only the arrival order and job labels. The authors provide an explicit formula for the asymptotic tail improvement ratio and show how to numerically find the waiting and response time distributions.
Zitieren
APA
Charlet, N., & Houdt, B. V. (2026). Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm. Operations Research, 74(4), 2161-2178. https://doi.org/10.1287/opre.2024.1061
Vancouver
Charlet N, Houdt BV. Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm. Operations Research. 2026;74(4):2161-2178. doi:10.1287/opre.2024.1061
BibTeX
@article{Charlet2026,
author = {Charlet, Nils and Houdt, Benny Van},
title = {Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm},
journal = {Operations Research},
year = {2026},
volume = {74},
number = {4},
pages = {2161--2178},
doi = {10.1287/opre.2024.1061}
}
EUVIMED