A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies

DOI10.1145/2897518.2897532MaRDI QIDQ5361827zbMATH OpenOpenAlexFDO

Authors Elaine Levey, Thomas Rothvoß

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.07808

zbMATH Keywords

approximation algorithmshierarchieslinear programming relaxationsscheduling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05)

Abstract: 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 is one of the remaining four open problems from the book of Garey & Johnson whether or not this problem is $mathbfNP$-hard for $m=3$. We prove that for any fixed $varepsilon$ and $m$, an LP-hierarchy lift of the time-indexed LP with a slightly super poly-logarithmic number of $r=(log(n){)}^{Theta(loglogn)}$ rounds provides a $(1+varepsilon)$-approximation. For example Sherali-Adams suffices as hierarchy. This implies an algorithm that yields a $(1+varepsilon)$-approximation in time $n^{O(r)}$. The previously best approximation algorithms guarantee a $2-frac73m+1$-approximation in polynomial time for $mgeq4$ and $frac43$ for $m=3$. Our algorithm is based on a recursive scheduling approach where in each step we reduce the correlation in form of long chains. Our method adds to the rather short list of examples where hierarchies are actually useful to obtain better approximation algorithms.

Recommendations

• A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• scientific article; zbMATH DE number 1187166
• An efficient approximation algorithm for minimizing makespan on uniformly related machines.
• Hardness of precedence constrained scheduling on identical machines

Cited in

(10)

• Semidefinite and linear programming integrality gaps for scheduling identical machines
• Server cloud scheduling
• A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• An improved approximation algorithm for scheduling under arborescence precedence constraints
• Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
• Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
• Server cloud scheduling
• A (3/2+1/e)-approximation algorithm for ordered TSP

This page was built for publication: A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361827)