论文信息 - A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies - 字舞流文

A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies

In a classical problem in scheduling, one has $n$ unit size jobs with a precedence order and the goal is to find a schedule of those jobs on $m$ identical machines as to minimize the makespan. It i...

Thomas Rothvoss | Elaine Levey

[1] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[2] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[3] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[4] Gerhard J. Woeginger,et al. Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[5] Shui Lam,et al. Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..

[6] Abhiram G. Ranade,et al. Precedence constrained scheduling in (2 - 7/(3p+1)) optimal , 2008, J. Comput. Syst. Sci..