Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach
From MaRDI portal
Publication:930950
DOI10.1016/j.ejor.2007.08.025zbMath1146.90312OpenAlexW2012738290MaRDI QIDQ930950
Publication date: 24 June 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.025
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ Retail store operations: literature review and research directions ⋮ Optimal order lot sizing and pricing with free shipping ⋮ Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem ⋮ The multi-objective multi-item just-in-time transportation problem
Cites Work
- Unnamed Item
- Production and shipment lot sizing in a vendor--buyer supply chain with transportation cost
- Dynamic Version of the Economic Lot Size Model
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- Optimal outbound dispatch policies: Modeling inventory and cargo capacity
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
