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

Optimal Inventory Policies under a Hierarchy of Setup Costs

Author

Listed:
  • Donald M. Simmons

    (W. R. Grace & Company, Cambridge, Massachusetts)

Abstract

This paper considers multi-product inventory problems which are subject to an order cost or setup cost hierarchy of the following form: all replenishment orders issued in any given scheduling period are filled in the next period, with the total setup cost of replenishing N different products in one period being S + s N . The values of N observed in the various periods, and therefore the expected setup cost per job, depend on the unknown lot sizes. This type of setup cost dependence can arise in simple inventory problems but is more commonly found in production environments in which the setup cost for a given job depends on the job immediately preceding it in the production schedule. Assuming demands to be random with known probability distributions, an iterative algorithm is presented for computing optimal lot sizes and reorder points for a set of heterogeneous products.

Suggested Citation

  • Donald M. Simmons, 1972. "Optimal Inventory Policies under a Hierarchy of Setup Costs," Management Science, INFORMS, vol. 18(10), pages 591-599, June.
    • Handle: RePEc:inm:ormnsc:v:18:y:1972:i:10:p:b591-b599
    DOI: 10.1287/mnsc.18.10.B591
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. Hossein Safizadeh, 1990. "Optimization in simulation: Current issues and the future outlook," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 807-825, December.
    2. Das, Rubel & Hanaoka, Shinya, 2014. "Relief inventory modelling with stochastic lead-time and demand," European Journal of Operational Research, Elsevier, vol. 235(3), pages 616-623.
    3. Lee, Loo Hay & Chew, Ek Peng, 2005. "A dynamic joint replenishment policy with auto-correlated demand," European Journal of Operational Research, Elsevier, vol. 165(3), pages 729-747, September.

    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:18:y:1972:i:10:p:b591-b599. 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.