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

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.

authors

• Curry, Guy

published proceedings

• Management Science

author list (cited authors)

• Hartfiel, D. J., & Curry, G. L.

citation count

• 5

complete list of authors

• Hartfiel, DJ||Curry, GL

publication date

• January 1974

publisher

• Institute for Operations Research and the Management Sciences (INFORMS)  Publisher

published in

• Management science  Journal

keywords

• Cost Effectiveness Research

Digital Object Identifier (DOI)

• 10.1287/mnsc.20.8.1175

start page

• 1175

end page

• 1177

volume

• 20

issue

• 8

URL

• http://dx.doi.org/10.1287/mnsc.20.8.1175