Approximate Deadline-Scheduling with Precedence Constraints.
Hossein EfsandiariMohammad Taghi HajiaghayiJochen KönemannHamid MahiniDavid L. MalecLaura SanitàPublished in: ESA (2015)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- single machine scheduling problem
- approximation algorithms
- sequence dependent setup times
- setup times
- vertex cover
- global constraints
- partial order
- partially ordered
- maximum lateness
- single machine
- series parallel
- unit length
- lower bound
- scheduling algorithm
- response time
- np hard
- resource constraints
- branch and bound
- lagrangian relaxation
- flowshop
- combinatorial optimization
- tabu search
- identical machines
- upper bound
- multi objective
- search space