The Markovian Two-echelon Repairable Item Provisioning Problem
研究了两级维修的可修件供应系统，在故障和维修时间服从指数分布下，提出新算法计算长期平均运行机器数，并优化机器数和维修通道数以最小化成本并满足服务水平约束。
A repairable-item provisioning system with two levels of repair is presented. Under the assumption that the machine time-to-failure and the repair times are exponentially distributed, a new algorithm is developed to compute the long-run average number of machines operating. Using the new algorithm we determine the optimal number of machines and repair channels at the two repair centres to minimize cost and meet a service-level constraint. The algorithm, which is based on Little's result in queueing theory and the theory of regenerative processes, is extremely efficient in terms of computer storage and execution time.