A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler.
Mauro LeonciniManuela MontangeroPaolo ValentePublished in: RTNS (2017)
Keyphrases
- branch and bound algorithm
- lower bound
- upper bound
- single machine scheduling problem
- scheduling algorithm
- branch and bound
- lower bounding
- precedence constraints
- worst case
- scheduling problem
- np hard
- single machine
- randomly generated problems
- branch and bound method
- linear programming relaxation
- lower and upper bounds
- release dates
- variable ordering
- lagrangian relaxation
- processing times
- upper bounding
- objective function
- mixed integer linear programming
- optimal solution
- response time
- setup times
- sequence dependent setup times
- column generation
- maximum clique
- packet scheduling
- max sat
- message passing