A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints.
Hwa-Joong KimDong-Ho LeePaul C. XirouchakisPublished in: J. Oper. Res. Soc. (2006)
Keyphrases
- capacity constraints
- lagrangian relaxation
- minimum cost
- network flow
- column generation
- scheduling problem
- lower bound
- upper bound
- feasible solution
- single item
- np hard
- bicriteria
- integer programming
- linear programming
- optimal solution
- resource allocation
- multi item
- production planning
- lower and upper bounds
- branch and bound
- lp relaxation
- optimization model