A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF.
Mauro LeonciniManuela MontangeroPaolo ValentePublished in: Real Time Syst. (2019)
Keyphrases
- branch and bound algorithm
- lower bound
- upper bound
- single machine scheduling problem
- branch and bound
- single machine
- scheduling problem
- lower bounding
- np hard
- lower and upper bounds
- mixed integer linear programming
- worst case
- scheduling algorithm
- search tree
- precedence constraints
- randomly generated problems
- release dates
- objective function
- upper bounding
- variable ordering
- optimal solution
- lagrangian relaxation
- sequence dependent setup times
- branch and bound method
- max sat
- processing times
- cutting plane
- combinatorial optimization
- linear programming
- parallel machines
- linear programming relaxation
- search algorithm
- neural network