Computing optimal (s, S) policies in inventory models with continuous demands

Special algorithms have been developed to compute an optimal (s, S) policy for an inventory model with discrete demand and under standard assumptions (stationary data, a well-behaved one-period cost function, full backlogging and the average cost criterion). We present here an iterative algorithm for continuous demand distributions which avoids any form of prior discretization. The method can be viewed as a modified form of policy iteration applied to a Markov decision process with continuous state space. For phase-type distributions, the calculations can be done in closed form.

[1]  H. M. Wagner,et al.  An Empirical Study of Exactly and Approximately Optimal Inventory Policies , 1965 .

[2]  A. F. Veinott,et al.  Computing Optimal (s, S) Inventory Policies , 1965 .

[3]  C. Derman.  DENUMERABLE STATE MARKOVIAN DECISION PROCESSES: AVERAGE COST CRITERION. , 1966 .

[4]  Jr. Arthur F. Veinott.  On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof , 1966 .

[5]  E. Denardo.  CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .

[6]  Ellis L. Johnson.  On (s, S) Policies , 1968 .

[7]  Amedeo R. Odoni,et al.  On Finding the Maximal Gain for Markov Decision Processes , 1969, Oper. Res..

[8]  N. A. J. Hastings.  Technical Note - Bounds on the Gain of a Markov Decision Process , 1971, Oper. Res..

[9]  B. D. Sivazlian.  Dimensional and Computational Analysis in Stationary s, S Inventory Problems with Gamma Distributed Demand , 1971 .

[10]  P. Kakumanu.  Continuously Discounted Markov Decision Model with Countable State and Action Space , 1971 .

[11]  N. Furukawa.  Markovian Decision Processes with Compact Action Spaces , 1972 .

[12]  A. Hordijk,et al.  Convergence results and approximations for optimal (s,s) policies , 1974 .

[13]  E. Naddor.  Optimal and Heuristic Decisions in Single-and Multi-Item Inventory Systems , 1975 .

[14]  van der J Jan Wal,et al.  Strongly convergent dynamic programming : some results , 1976 .

[15]  B. Doshi.  Continuous Time Control of Markov Processes on an Arbitrary State Space: Discounted Rewards , 1976 .

[16]  Awi Federgruen,et al.  A GENERAL MARKOV DECISION METHOD I: MODEL AND TECHNIQUES , 1977 .

[17]  P. Kakumanu,et al.  Relation between continuous and discrete time markovian decision problems , 1977 .

[18]  Christine Küenle,et al.  Durchschnittsoptimale strategien in Markovschen entscheidungsmodellea bei unbeschränkten kosten , 1977 .

[19]  A. Federgruen,et al.  A general markov decision method II: Applications , 1977, Advances in Applied Probability.

[20]  E. Silver,et al.  s, S Policies Under Continuous Review and Discrete Compound Poisson Demand , 1978 .

[21]  Helmut Schneider,et al.  Methods for Determining the Re-order Point of an (s, S) Ordering Policy when a Service Level is Specified , 1978 .

[22]  A. Federgruen,et al.  The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms , 1978 .

[23]  R. Ehrhardt.  The Power Approximation for Computing (s, S) Inventory Policies , 1979 .

[24]  Martin L. Puterman,et al.  On the Convergence of Policy Iteration in Stationary Dynamic Programming , 1979, Math. Oper. Res..

[25]  Evan L. Porteus.  Technical Note - An Adjustment to the Norman-White Approach to Approximating Dynamic Programs , 1979, Oper. Res..

[26]  Evan L. Porteus,et al.  Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies , 1980, Oper. Res..

[27]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[28]  B. Doshi,et al.  Optimal switching among a finite number of Markov processes , 1981 .

[29]  Izzet Sahin,et al.  On the Objective Function Behavior in (s, S) Inventory Models , 1982, Oper. Res..

[30]  Awi Federgruen,et al.  Allocation policies and cost approximations for multilocation inventory systems , 1984 .

[31]  Paul H. Zipkin,et al.  Approximations of Dynamic, Multilocation Production and Inventory Problems , 1984 .

[32]  Henk Tijms,et al.  Simple approximations for the reorder point in periodic and continuous review (s, S) inventory systems with service level constraints , 1984 .

[33]  Awi Federgruen,et al.  Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model , 1984, Oper. Res..

[34]  Awi Federgruen,et al.  An Efficient Algorithm for Computing Optimal (s, S) Policies , 1984, Oper. Res..