Optimizing a multi-echelon location-inventory problem with joint replenishment: A Lipschitz ϵ-optimal approach using Lagrangian relaxation.
Lin WangSirui WangYeming GongLu PengPublished in: Comput. Oper. Res. (2023)
Keyphrases
- multi echelon
- joint replenishment
- lagrangian relaxation
- lead time
- assembly systems
- single item
- setup cost
- lot sizing
- supply chain
- integer programming
- inventory control
- dynamic programming
- service level
- inventory models
- column generation
- mixed integer programming
- np hard
- lower bound
- branch and bound algorithm
- feasible solution
- linear programming
- lower and upper bounds
- multi item
- learning algorithm
- single machine scheduling problem
- holding cost
- random variables
- special case