Approximations of Dynamic, Multilocation Production and Inventory Problems

Awi Federgruen and Paul Zipkin
Additional contact information
Awi Federgruen: Columbia University
Paul Zipkin: Columbia University

Management Science, 1984, vol. 30, issue 1, 69-84

Abstract: Consider a central depot (or plant) which supplies several locations experiencing random demands. Orders are placed (or production is initiated) periodically by the depot. The order arrives after a fixed lead time, and is then allocated among the several locations. (The depot itself does not hold inventory.) The allocations are finally received at the demand points after another lag. Unfilled demand at each location is backordered. Linear costs are incurred at each location for holding inventory and for backorders. Also, costs are assessed for orders placed by the depot. The object is to minimize the expected total cost of the system over a finite number of time periods. This system gives rise to a dynamic program with a state space of very large dimension. We show that this model can be systematically approximated by a single-location inventory problem. All the qualitative and quantitative results for such problems can then be applied.

Keywords: inventory and production; approximations; stochastic models (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (78)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.1.69 (application/pdf)

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:inm:ormnsc:v:30:y:1984:i:1:p:69-84

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().