A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions.