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

Edward A Silver

Naval Research Logistics Quarterly, 1979, vol. 26, issue 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.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/nav.3800260113

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:26:y:1979:i:1:p:141-151

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().