An Algorithm for Optimal Inventory Policies For Systems with Joint Setup Costs

D. J. Hartfiel and G. L. Curry
Additional contact information
D. J. Hartfiel: Texas A & M University
G. L. Curry: Texas A & M University

Management Science, 1974, vol. 20, issue 8, 1175-1177

Abstract: This paper presents an algorithm inventory policies for a class of multi-product dependent setup cost problems. The operational policy under consideration is to replenish jointly, at a reduced cost, all products of the dependent class which are to be ordered in a scheduling period. Demands are assumed to be random with known probability distributions. Convergence of the iterative algorithm, to the optimal solution under suitable hypotheses is proven. Comparisons with the results of a simpler algorithm by Simmons demonstrate the cost advantages of our method.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.8.1175 (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:20:y:1974:i:8:p:1175-1177

Access Statistics for this article

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