A branch and bound algorithm for the response time variability problem.
Alberto García-VilloriaAlbert CorominasXavier DelormeAlexandre DolguiWieslaw KubiakRafael PastorPublished in: J. Sched. (2013)
Keyphrases
- branch and bound algorithm
- response time
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- test problems
- lower bounding
- precedence constraints
- combinatorial optimization
- scheduling algorithm
- quality of service
- mixed integer linear programming
- randomly generated problems
- variable ordering
- upper bounding
- lagrangian relaxation
- query execution
- neural network
- single machine scheduling problem
- max sat
- partial order
- branch and bound method
- maximum clique
- integer variables
- search space
- finding an optimal solution