IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i1p69-84.html
   My bibliography  Save this article

Approximations of Dynamic, Multilocation Production and Inventory Problems

Author

Listed:
  • Awi Federgruen

    (Columbia University)

  • Paul Zipkin

    (Columbia University)

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.

Suggested Citation

  • Awi Federgruen & Paul Zipkin, 1984. "Approximations of Dynamic, Multilocation Production and Inventory Problems," Management Science, INFORMS, vol. 30(1), pages 69-84, January.
    • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:1:p:69-84
    DOI: 10.1287/mnsc.30.1.69
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.1.69
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.30.1.69?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:1:p:69-84. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.