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

Optimal Policies for a Multi-Echelon Inventory Problem

Author

Listed:
  • Andrew J. Clark

    (Planning Research Corporation, Los Angeles, California)

  • Herbert Scarf

    (Stanford University, Stanford, California)

Abstract

In the last several years there have been a number of papers discussing optimal policies for the inventory problem. Almost without exception these papers are devoted to the determination of optimal purchasing quantities at a single installation faced with some pattern of demand. It has been customary to make the assumption that when the installation in question requests a shipment of stock, this shipment will be delivered in a fixed or perhaps random length of time, but at any rate with a time lag which is independent of the size of the order placed. There are, however, a number of situations met in practice in which this assumption is not a tenable one. An important example arises when there are several installations, say 1, 2, ..., N, with installation 1 receiving stock from 2, with 2 receiving stock from 3, etc. In this example, if an order is placed by installation 1 for stock from installation 2, the length of time for delivery of this stock is determined not only by the natural lead time between these two sites, but also by the availability of stock at the second installation. In this paper we shall consider the problem of determining optimal purchasing quantities in a multi-installation model of this type.

Suggested Citation

  • Andrew J. Clark & Herbert Scarf, 1960. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 6(4), pages 475-490, July.
    • Handle: RePEc:inm:ormnsc:v:6:y:1960:i:4:p:475-490
    DOI: 10.1287/mnsc.6.4.475
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.6.4.475
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.6.4.475?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
    ---><---

    Other versions of this item:

    More about this item

    Statistics

    Access and download statistics

    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:6:y:1960:i:4:p:475-490. 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.