Lagrangian relaxation and constraint generation for allocation and advanced scheduling.
Yasin GocgunArchis GhatePublished in: Comput. Oper. Res. (2012)
Keyphrases
- lagrangian relaxation
- capacity constraints
- setup times
- resource allocation
- integer programming
- branch and bound algorithm
- feasible solution
- lower bound
- precedence relations
- np hard
- linear programming
- column generation
- dynamic programming
- dual variables
- lower and upper bounds
- scheduling problem
- unit commitment
- dual decomposition
- resource constraints
- precedence constraints
- lagrangian heuristic
- network design problem
- relaxation algorithm
- shortest path
- subgradient method
- single machine scheduling problem
- release dates
- upper bound
- container terminal
- linear constraints
- mixed integer linear programs
- sequence dependent setup times
- learning algorithm
- lot sizing
- computational complexity
- objective function