A branch and bound algorithm to minimize the total tardiness for m.
Chia-Shin ChungJames FlynnÖmer KircaPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- branch and bound algorithm
- single machine scheduling problem
- lower bound
- branch and bound
- precedence constraints
- sequence dependent setup times
- upper bound
- release dates
- combinatorial optimization
- optimal solution
- test problems
- np hard
- lower bounding
- setup times
- mixed integer linear programming
- single machine
- randomly generated problems
- upper bounding
- lagrangian relaxation
- variable ordering
- max sat
- integer variables
- maximum clique
- finding an optimal solution
- branch and bound method
- maximum lateness
- solution quality
- simulated annealing
- search algorithm