A Simpler Analysis for $\epsilon$-Clairvoyant Flow Time Scheduling

Abstract

We simplify the proof of the optimality of the Shortest Lower-Bound First (SLF) algorithm, introduced by Gupta, Kaplan, Lindermayr, Schlöter, and Yingchareonthawornchai [FOCS'25], for minimizing the total flow time in the $\epsilon$-clairvoyant setting.