On the Approximability of Single-Machine Scheduling with Precedence Constraints.
Christoph AmbühlMonaldo MastrolilliNikolaus MutsanasOla SvenssonPublished in: Math. Oper. Res. (2011)
Keyphrases
- precedence constraints
- approximation algorithms
- scheduling problem
- branch and bound algorithm
- precedence relations
- vertex cover
- np hard
- release dates
- parallel processors
- special case
- sequence dependent setup times
- worst case
- maximum lateness
- single machine scheduling problem
- setup times
- global constraints
- unit length
- series parallel
- partially ordered
- partial order
- parallel machines
- partially ordered sets
- polynomial time approximation
- computer systems
- probabilistic model