A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints

Subscribers:
343,000
Published on ● Video Link: https://www.youtube.com/watch?v=z70HEtjYDaM



Duration: 47:47
271 views
2


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 and Johnson whether or not this problem is NP-hard for m=3. We prove that for any fixed epsilon and m, a Sherali-Adams / Lasserre lift of the time-index LP with slightly super poly-logarithmic number of rounds provides a (1+epsilon)-approximation. The previously best approximation algorithms guarantee a 2-7/(3m+1)-approximation in polynomial time for m>=4 and 4/3 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. This is joint work with Elaine Levey.




Other Videos By Microsoft Research


2016-06-22Verasco, a formally verified C static analyzer
2016-06-22Symposium: Deep Learning - Max Jaderberg
2016-06-22Satisfiability of Ordering CSPs Above Average Is Fixed-Parameter Tractable
2016-06-22Symposium: Deep Learning - Harri Valpola
2016-06-22Machine Learning as Creative Tool for Designing Real-Time Expressive Interactions
2016-06-22Symposium: Deep Learning - Sergey Ioffe
2016-06-22Multi-rate neural networks for efficient acoustic modeling
2016-06-22Robust Spectral Inference for Joint Stochastic Matrix Factorization and Topic Modeling
2016-06-22Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares
2016-06-22Extreme Classification: A New Paradigm for Ranking & Recommendation
2016-06-22A Lasserre-Based (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints
2016-06-22Oral Session: Learning Theory and Algorithms for Forecasting Non-stationary Time Series
2016-06-22Recent Developments in Combinatorial Optimization
2016-06-22Invited Talks: Computational Principles for Deep Neuronal Architectures
2016-06-22Coalescence in Branching Trees and Branching Random Walks
2016-06-22Oral Session: Randomized Block Krylov Methods
2016-06-22Oral Session: Fast Convergence of Regularized Learning in Games
2016-06-22Ito Processes, Correlated Sampling and Applications
2016-06-22Statistical and computational trade-offs in estimation of sparse principal components.
2016-06-22How to Write a Great Research Paper
2016-06-22Graphical Bandits



Tags:
microsoft research
algorithms