Approximate Deadline-Scheduling with Precedence Constraints.
Hossein EsfandiariMohammad Taghi HajiaghayiJochen KönemannHamid MahiniDavid L. MalecLaura SanitàPublished in: CoRR (2015)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- approximation algorithms
- vertex cover
- partially ordered
- setup times
- sequence dependent setup times
- maximum lateness
- partial order
- single machine scheduling problem
- series parallel
- unit length
- global constraints
- scheduling algorithm
- single machine
- processing times
- response time
- tabu search
- total tardiness
- lower bound
- np hard
- resource constraints
- branch and bound
- multistage
- np complete
- identical machines
- particle swarm optimization
- linear programming