We simplify the proof of the optimality of the Shortest Lower-Bound First (SLF) algorithm, introduced by Gupta, Kaplan, Lindermayr, Schl\"oter, and Yingchareonthawornchai [FOCS'25], for minimizing the total flow time in the ε-clairvoyant setting.
Cite
@article{arxiv.2603.17542,
title = {A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling},
author = {Anupam Gupta and Haim Kaplan and Alexander Lindermayr and Jens Schlöter and Sorrachai Yingchareonthawornchai},
journal= {arXiv preprint arXiv:2603.17542},
year = {2026}
}