Abstract
We study a discrete-time (s, S) perishable inventory model with geometric inter‐demand times and batch demands. With a zero lead time and allowing backlogs, we can construct a multi‐dimensional Markov chain to model the inventory‐level process and obtain a closed‐formcost function. Numerical computation for the discrete‐time models is quite manageable. Our numerical results reveal some good properties of the cost function. By comparing our results with results from the corresponding continuous‐time models, we may also conclude that discrete‐time models may be used to approximate their continuous‐time counterparts effectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.S. Alfa and S. Chakravarthy, A discrete queue with the Markovian arrival process and phase type primary and secondary services, Stoch. Models 10(1994)437-451.
A.S. Alfa and I. Frigui, Discrete NT-policy single server queue with Markovian arrival process, Euro. J. Oper. Res. 88(1996)599-613.
A.S. Alfa and M.F. Neuts, Modeling vehicular traffic using discrete time Markovian arrival process, Transportation Science 29(1995)109-117.
S.K. Bar-Lev and D. Perry, A discrete time Markovian inventory model for perishable commodities, Stochastic Analysis and Applications 7(1989)243-259.
D. Chazan and S. Gal, A Markovian model for a perishable product inventory, Mgmt. Sci. 23(1977) 512-521.
M.A. Cohen, Analysis of single critical number ordering policies for perishable inventories, Oper. Res. 24(1976)726-741.
B. Fries, Optimal order policy for a perishable commodity with fixed lifetime, Oper. Res. 23(1975) 46-61.
A. Gravey, J.R. Louvion and P. Boyer, On the Geo/D/1 and Geo/D/1/n queues, Performance Evaluation 11(1990)117-125.
D. Liu and M.F. Neuts, A queueing model for an ATM rate control scheme, Telecommunication Systems 2(1994)321-348.
L. Liu and Z. Lian, An (s, S) continuous review model for perishable inventory, Working Paper, IEEM95.11, Dept. Of IEEM, HKUST, 1995, to appear in Oper. Res. (Jan-Feb. 1999).
L. Liu and Z. Lian, An (s, S) continuous review perishable inventory model with batch demand, Working Paper, IEEM97.01, Dept. of IEEM, HKUST, 1997.
A.K. Moorthy, Y.C. Narasimhulu and R.I. Basha, On perishable inventory with Markov chain demand quantities, Int. J. of Information and Mgmt. Sci. 3(1992)29-37.
S. Nahmias, Optimal ordering policies for perishable inventory-II, Oper. Res. 23(1975)735-749.
S. Nahmias, Myopic approximations for the perishable inventory problem, Mgmt. Sci. 22(1976) 1002-1008.
S. Nahmias, Perishable inventory theory: A review, Oper. Res. 30(1982)680-707.
P. Nansakumar and T.T. Morton, Near myopic heuristics for the fixed-life perishable problem, Mgmt. Sci. 39(1993)1490-1498.
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, Dover, New York, 1981.
M.F. Neuts, Algorithmic Probability, Chapman and Hall, London, 1995.
N. Ravichandran, Stochastic analysis of a continuous review perishable inventory system with positive lead time and Poisson demand, Eur. J. Oper. Res. 84(1995)444-457.
C.P. Schmidt and S. Nahmias, (S — 1, S) policies for perishable inventory, Mgmt. Sci. 31(1985)719-728.
H.J. Weiss, Optimal ordering policies for continuous review perishable inventory models, Oper. Res. 28(1980)365-374.
T. Yang and M.L. Chaudhry, On steady-state queue size distributions of the discrete-time GI/G/1 queue, Adv. Appl. Prob. 28(1996)1177-1200.
Rights and permissions
About this article
Cite this article
Lian, Z., Liu, L. A discrete‐time model for perishable inventory systems. Annals of Operations Research 87, 103–116 (1999). https://doi.org/10.1023/A:1018960314433
Issue Date:
DOI: https://doi.org/10.1023/A:1018960314433