Abstract:We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bounded ℓ 1 -norm) setting to bounds on the flow time of an optimal schedule.Combining our reduction with a deep result proved by Banaszczyk via convex geometry, give guarantees of O( √ log n) and O( √ log n log P ) for max flow time and total flow time, respectiv… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.