A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies.
Elaine LeveyThomas RothvoßPublished in: SIAM J. Comput. (2021)
Keyphrases
- precedence constraints
- scheduling problem
- release dates
- approximation algorithms
- np hard
- flowshop
- parallel machines
- precedence relations
- single machine scheduling problem
- parallel processors
- single machine
- sequence dependent setup times
- branch and bound algorithm
- setup times
- vertex cover
- unrelated parallel machines
- maximum lateness
- linear programming
- processing times
- job shop
- tabu search
- partial order
- unit length
- series parallel
- partially ordered sets
- scheduling jobs
- optimal solution
- linear program
- worst case
- np complete
- release times
- integer programming
- polynomial time approximation
- strongly np hard
- identical machines
- special case
- makespan minimization
- constraint satisfaction problems
- computational complexity
- lower bound
- simulated annealing
- partially ordered
- feasible solution
- global constraints