Perishable inventories with random input: a unifying survey with extensions
本文综述并扩展了易腐品库存系统的概率分析，通过虚拟过期过程统一研究，推导稳态密度及关键绩效指标，对库存管理研究者有参考价值。
Abstract This paper is devoted to the theory of perishable inventory systems. In such systems items arrive and stay ‘on the shelf’ until they are either taken by a demand or become outdated. Our aim is to survey, extend and enrich the probabilistic analysis of a large class of such systems. A unifying principle is to consider the so-called virtual outdating process $$\textbf{V}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>V</mml:mi> </mml:math> , where V ( t ) is the time that would pass from t until the next outdating if no new demands arrived after t . The steady-state density of $$\textbf{V}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>V</mml:mi> </mml:math> is determined for a wide range of perishable inventory systems. Key performance measures like the rate of outdatings, the rate of unsatisfied demands and the distribution of the number of items on the shelf are subsequently expressed in that density. Some of the main ingredients of our analysis are level crossing theory and the observation that the $$\textbf{V}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>V</mml:mi> </mml:math> process can be interpreted as the workload process of a specific single server queueing system.