Supply chain planning with order/setup costs and capacity constraints a new Lagrangian relaxation approach.
Haoxun ChenChengbin ChuPublished in: ICRA (2003)
Keyphrases
- supply chain
- lagrangian relaxation
- capacity constraints
- lead time
- single item
- setup cost
- integer programming
- feasible solution
- lower bound
- lot sizing
- linear programming
- lost sales
- network flow
- dynamic programming
- decision making
- column generation
- minimum cost
- np hard
- lower and upper bounds
- mixed integer programming
- branch and bound algorithm
- single machine scheduling problem
- operating costs
- approximation algorithms
- multi item
- special case
- evolutionary algorithm