摘要
The expected cost per unit of time for a sequential inspection policy is derived. It still has some difficulties to compute an optimal sequential policy numerically, which minimizes the expected cost of a system with finite number of inspections. This paper gives the algorithm for an optimal inspection schedule and specifies the computing procedure for a Weibull distribution. Using this algorithm, optimal inspection times are computed as a numerical result. Compared with the periodic point inspection, the policies in this paper reduce the cost successfully.
首先导出了点检时间序列相对应的期望成本 .由于使具有有限点检次数库存系统期望成本降低到最小的最优点检时间序列的数值计算比较困难 ,本文给出了计算一般最优点检时间序列的算法和Weibull分布情况下的计算步骤实例 .据此计算出最优点检策略的数值结果 .与周期点检策略相比 ,本文策略有效地降低了成本 .
