Optimal allocation of minimal & perfect repairs under resource constraints

Optimal allocation of minimal & perfect repairs under resource constraints
复制标题

DOI:
10.1109/tr.2004.829143
复制
发表时间:
2004-06
影响因子:
5.9
通讯作者:
L. Cui;W. Kuo;H. Loh;Min Xie
L. Cui;W. Kuo;H. Loh;Min Xie
中科院分区:
计算机科学2区
文献类型:
--
作者:
L. Cui;W. Kuo;H. Loh;Min Xie

文献摘要

被引文献

相似文献

一个复杂系统的维修效果通常可大致分为以下两种类型:最小维修,即通过最小的努力使系统恢复到其运行状态;完全维修,即对系统进行更换或维修使其达到全新状态。当两种维修类型都可行时,一个重要的问题是确定维修策略,即故障发生后应进行的维修类型。本文研究了在一些资源约束下,具有单调失效率的可维修系统的最优分配问题。在第一个模型中,最小维修和完全维修的次数是固定的,研究了使系统期望寿命最大化的最优维修策略。在第二个模型中,维修资源总量是固定的,并且假设每次最小维修和完全维修的成本是已知的。在此情况下推导出了最优分配算法。给出了两个数值例子来说明这些过程。
The effect of a repair of a complex system can usually be approximated by the following two types: minimal repair for which the system is restored to its functioning state with minimum effort, or perfect repair for which the system is replaced or repaired to a good-as-new state. When both types of repair are possible, an important problem is to determine the repair policy; that is, the type of repair which should be carried out after a failure. In this paper, an optimal allocation problem is studied for a monotonic failure rate repairable system under some resource constraints. In the first model, the numbers of minimal & perfect repairs are fixed, and the optimal repair policy maximizing the expected system lifetime is studied. In the second model, the total amount of repair resource is fixed, and the costs of each minimal & perfect repair are assumed to be known. The optimal allocation algorithm is derived in this case. Two numerical examples are shown to illustrate the procedures.