Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation
Author:
- 1 March 1979
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 26 (1) , 141-151
Abstract
We consider a group (or family) of items having deterministic, but time‐varying, demand patterns. The group is defined by a setup‐cost structure that makes coordination attractive (a major setup cost for each group replenishment regardless of how many of the items are involved). The problem is to determine the timing and sizes of the replenishments of all of the items so as to satisfy the demand out to a given horizon in a cost‐minimizing fashion. A dynamic programming formulation is illustrated for the case of a two‐item family. It is demonstrated that the dynamic programming approach is computationally reasonable, in an operational sense, only for small family sizes. For large families heuristic solution methods appear necessary.Keywords
This publication has 21 references indexed in Scilit:
- Determination of Optimum Packaging Frequency of Items Jointly ReplenishedManagement Science, 1974
- Planning Horizons for the Dynamic Lot Size Model with BackloggingManagement Science, 1974
- A two product dynamic economic lot size production model with either‐or production constraintsNaval Research Logistics Quarterly, 1974
- An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling ProblemManagement Science, 1973
- Dynamic Lot Size Models for Multi-Stage Assembly SystemsManagement Science, 1973
- A Class of Deterministic Production Planning ProblemsManagement Science, 1973
- Deterministic Production Planning with Concave Costs and Capacity ConstraintsManagement Science, 1971
- Extensions of the Planning Horizon Theorem in the Dynamic Lot Size ModelManagement Science, 1969
- An economic lot-sizing technique, I: The part-period algorithmIBM Systems Journal, 1968
- A Linear Approach to the Dynamic Inventory ProblemManagement Science, 1966