Optimal Inventory Policies under a Hierarchy of Setup Costs

Donald M. Simmons
Additional contact information
Donald M. Simmons: W. R. Grace & Company, Cambridge, Massachusetts

Management Science, 1972, vol. 18, issue 10, B591-B599

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.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.10.B591 (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:18:y:1972:i:10:p:b591-b599

Access Statistics for this article

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