Abstract
In this paper, we deal with a multi-item, stochastic, periodic review inventory system with general cost structure which permits partial or complete backlogging of unfilled demand. Since both the (σ, S) policy and the mixed reorder policy are not optimal, we derive several properties of an optimal ordering policy and propose a new algorithm for computing it. This algorithm is based on the policy iteration method (PIM), but reduces substantially computation times in the policy evaluation and improvement routines of the PIM.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bather J (1973) Optimal decision procedures for finite Markov chains part II: Communicating Systems. Adv in Appl Prob 5:521–540
Goswick TE, Sivazlian BD (1974) The mixed ordering policy in periodic review stochastic multi-commodity inventory systems. Nav Res Log Quart 21:389–410
Howard RA (1960) Dynamic programming and Markov processes. Wiley, New York
Ignall E, Veinott Jr. AF (1969) Optimality of myopic inventory policies for several substitute products. Management Sci 15:284–304
Johnson EL (1967) Optimality and computation of (σ, S) policies in the multi-item infinite horizon inventory problem. Management Sci 13:475–491
Kalin D (1980) On the optimality of (σ, S) policies. Math of Oper Res 5:293–307
Mahoney JF, Sivazlian BD (1980) Probability of shortage for Erlang distributed demand in a (σ, S) inventory problem. SIAM J Appl Math 38:156–162
Schweitzer PJ, Federgruen A (1978) The functional equations of undiscounted Markov renewal programming. Math of Oper Res 3:308–321
Sivazlian BD (1970) Asymptotic approximations to ordering policies in a stationary (σ, S) inventory problem. SIAM J Appl Math 19:155–166
Sivazlian BD (1971) Stationary analysis of a multicommodity inventory system with interacting set-up costs. SIAM J Appl Math 20:264–278
Sivazlian BD, Wei Y-C (1990) Approximation methods in the optimization of a stationary (σ, S) inventory problem. Oper Res Lett 9:105–113
Veinott Jr. AF (1965) Optimal policy for a multi-product, dynamic, nonstationary inventory problem. Management Sci 12:206–222
Veinott Jr. AF (1966a) The status of mathematical inventory theory. Management Sci 12: 745–777
Veinott Jr. AF (1966b) On finding optimal policies in discrete dynamic programming with no discounting. Annals of Math Statis 37:1284–1296
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ohno, K., Ishigaki, T. & Yoshii, T. A new algorithm for a multi-item periodic review inventory system. ZOR - Methods and Models of Operations Research 39, 349–364 (1994). https://doi.org/10.1007/BF01435462
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01435462