Simpler constant factor approximation algorithms for weighted flow time -- now for any $p$-norm

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time…