Improvement of Lagrangian Relaxation Convergence for Production Scheduling.
Roman BuilMiquel Angel Piera ErolesPeter B. LuhPublished in: IEEE Trans Autom. Sci. Eng. (2012)
Keyphrases
- production scheduling
- lagrangian relaxation
- column generation
- vehicle routing
- integer programming
- lower bound
- branch and bound algorithm
- feasible solution
- dynamic programming
- linear programming
- lower and upper bounds
- np hard
- job shop scheduling problem
- single machine
- dual variables
- dual decomposition
- job shop
- process planning
- manufacturing systems
- linear program
- lagrangian heuristic
- machine learning
- branch and bound
- simulated annealing
- memetic algorithm
- convergence rate
- complex systems
- search space