A tutorial of integrating duality and branch and bound in earliness-tardiness scheduling with idle insertion time problems.
Michael F. GormanDaniel G. ConwayPublished in: Int. J. Prod. Res. (2018)
Keyphrases
- branch and bound
- combinatorial optimization
- randomly generated problems
- lower bound
- branch and bound procedure
- branch and bound algorithm
- search algorithm
- branch and bound method
- column generation
- partial solutions
- upper bound
- optimal solution
- tree search
- network design problem
- search space
- mathematical programming
- integer programming problems
- lagrangian heuristic
- linear programming
- optimization problems
- objective function
- neural network