Pages that link to "Item:Q4184609"
From MaRDI portal
The following pages link to Coordinated replenishments of items under time-varying demand: Dynamic programming formulation (Q4184609):
Displaying 12 items.
- A dynamic production planning and scheduling algorithm for two products processed on one line (Q799234) (← links)
- Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach (Q930950) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
- A lower bound on a class of coordinated inventory/production problems (Q1091248) (← links)
- The coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q1278282) (← links)
- Multiple items procurement under stochastic nonstationary demands (Q1390261) (← links)
- Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← links)
- A review of the joint replenishment problem literature: 1989--2005 (Q2462102) (← links)
- Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
- More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ (Q5478823) (← links)
- Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research (Q6160339) (← links)
