A Branch and Bound Algorithm for the Total Weighted Tardiness Problem.
Chris N. PottsLuk N. Van WassenhovePublished in: Oper. Res. (1985)
Keyphrases
- total weighted tardiness
- branch and bound algorithm
- lagrangian relaxation
- single machine scheduling problem
- sequence dependent setup times
- lower bound
- precedence constraints
- branch and bound
- np hard
- optimal solution
- upper bound
- combinatorial optimization
- release dates
- single machine
- setup times
- scheduling problem
- column generation
- maximum lateness
- mixed integer programming
- max sat
- parallel machines
- lower and upper bounds
- processing times
- valid inequalities
- neural network
- knapsack problem
- objective function