Coordinated replenishments of items under time-varying demand: Dynamic programming formulation

DOI10.1002/nav.3800260113zbMath0399.90040OpenAlexW2089981513MaRDI QIDQ4184609

Edward A. Silver

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260113

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (12)

A lower bound on a class of coordinated inventory/production problems ⋮ Multiple items procurement under stochastic nonstationary demands ⋮ Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach ⋮ Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem ⋮ A review of the joint replenishment problem literature: 1989--2005 ⋮ A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand ⋮ Models and algorithms for the dynamic-demand joint replenishment problem ⋮ More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ ⋮ The coordinated replenishment dynamic lot-sizing problem with quantity discounts ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ A dynamic production planning and scheduling algorithm for two products processed on one line

This page was built for publication: Coordinated replenishments of items under time-varying demand: Dynamic programming formulation