Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines

SIAM Journal on Computing, 2019.

Cited by: 28|Bibtex|Views13|

Abstract:

We consider the problem of scheduling jobs on unrelated machines so as to minimize the sum of weighted completion times. Our main result is a $(3/2-c)$-approximation algorithm for some fixed $c>0$, improving upon the long-standing bound of 3/2 (independently due to Skutella, Journal of the ACM, 2001, and Sethuraman & Squillante, SODA, 1...More

Code:

Data:

Your rating :
0

 

Tags
Comments