论文信息 - Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines - 字舞流文

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

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 $(\nicefrac{3}{2}-c)$-approximation algorithm for some ...

Aravind Srinivasan | Ola Svensson | Nikhil Bansal

[1] Martin Skutella,et al. Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[2] Aravind Srinivasan,et al. A unified approach to scheduling on unrelated parallel machines , 2009, JACM.

[3] Ola Svensson. Santa Claus Schedules Jobs on Unrelated Machines , 2012, SIAM J. Comput..

[4] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[5] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..

[6] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.

[7] Uriel Feige,et al. Santa claus meets hypergraph matchings , 2008, TALG.

[8] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .