Scheduling products with bills of materials using an improved Lagrangian relaxation technique.
Christopher S. CzerwinskiPeter B. LuhPublished in: IEEE Trans. Robotics Autom. (1994)
Keyphrases
- lagrangian relaxation
- setup times
- branch and bound algorithm
- integer programming
- feasible solution
- precedence relations
- lower bound
- column generation
- np hard
- scheduling problem
- precedence constraints
- linear programming
- total weighted tardiness
- lower and upper bounds
- dual decomposition
- dynamic programming
- relaxation algorithm
- unit commitment
- lagrangian heuristic
- subgradient method
- capacity constraints
- branch and bound
- mixed integer programming
- mixed integer linear programs
- parallel machines
- scheduling algorithm
- upper bound
- shortest path
- production planning
- job shop
- sequence dependent setup times
- mixed integer program
- release dates
- sensitivity analysis
- linear program
- single machine
- single machine scheduling problem
- data structure