A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies.
Elaine LeveyThomas RothvossPublished in: STOC (2016)
Keyphrases
- precedence constraints
- scheduling problem
- release dates
- approximation algorithms
- np hard
- precedence relations
- parallel machines
- flowshop
- sequence dependent setup times
- single machine scheduling problem
- unrelated parallel machines
- single machine
- branch and bound algorithm
- linear programming
- setup times
- processing times
- parallel processors
- vertex cover
- maximum lateness
- strongly np hard
- linear program
- tabu search
- optimal solution
- identical parallel machines
- makespan minimization
- unit length
- lower bound
- series parallel
- job shop
- partial order
- partially ordered
- scheduling jobs
- special case
- polynomial time approximation
- identical machines
- queueing networks
- job shop scheduling problem
- constraint propagation
- partially ordered sets