Preprint
Sep 2026
Better Late Than Never: Online Flow Time Scheduling with Online Estimates
In the classical online flow-time scheduling problem on a single machine, jobs arrive over time and must be processed to minimize the total time they spend in the system: for over fifty years, we have known that SRPT is an optimal online algorithm. But this algorithm requires exactness in two different ways: (a) job si...
Anupam Gupta, Haim Kaplan, Alexander Lindermayr et al.
· 0 citations