Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm

Nils Charlet
Corresponding Author
Nils Charlet
[email protected]
https://orcid.org/0009-0006-1820-3596
Department of Computer Science, University of Antwerp, 2020 Antwerp, Belgium
Search for more papers by this author
,
Benny Van Houdt
Benny Van Houdt
[email protected]
https://orcid.org/0000-0002-5955-8493
Department of Computer Science, University of Antwerp, 2020 Antwerp, Belgium
Search for more papers by this author

Corresponding Author

Nils Charlet

[email protected]

https://orcid.org/0009-0006-1820-3596

Department of Computer Science, University of Antwerp, 2020 Antwerp, Belgium

Search for more papers by this author

,

Benny Van Houdt

Benny Van Houdt

[email protected]

https://orcid.org/0000-0002-5955-8493

Department of Computer Science, University of Antwerp, 2020 Antwerp, Belgium

Search for more papers by this author

Published Online:25 Mar 2026https://doi.org/10.1287/opre.2024.1061

Supplemental Material

opre.2024.1061.sm1.pdf

opre.2024.1061.cd.zip

cover image Operations Research

Articles In Advance

Article Information

Supplemental Material

Metrics

Information

Received:May 27, 2024
Accepted:February 08, 2026
Published Online:March 25, 2026

Copyright © 2026, INFORMS

Cite as

Nils Charlet, Benny Van Houdt (2026) Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm. Operations Research 0(0).

https://doi.org/10.1287/opre.2024.1061

Keywords

Acknowledgments

The authors thank Ziv Scully for the suggestion that Nudge*(M) could be optimal among scheduling algorithms that only use job type information and their order of arrival.