Minimum total weighted completion time: Faster approximation schemes

Leah Epstein, Asaf Levin

We study classic scheduling problems on uniformly related machines. Efficient polynomial time approximation schemes (EPTAS's) are fast and practical approximation schemes. New meth…