Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling.
Lixin TangHua XuanJiyin LiuPublished in: Comput. Oper. Res. (2007)
Keyphrases
- lagrangian relaxation
- single machine scheduling
- single machine scheduling problem
- dynamic programming
- forward and backward
- branch and bound algorithm
- integer programming
- feasible solution
- np hard
- lower bound
- column generation
- linear programming
- dual decomposition
- lower and upper bounds
- greedy algorithm
- upper bound
- cutting plane algorithm
- knapsack problem
- lagrangian heuristic
- mixed integer programming
- single machine
- valid inequalities
- stereo matching
- shortest path
- evolutionary algorithm