【24h】

OPTIMIZATION PROBLEM IN K-OUT-OF-N SYSTEM WITH NUMBER-DEPENDENT MINIMAL REPAIR

机译:数量依赖最小维修的K-out-of-N系统的优化问题

获取原文
获取原文并翻译 | 示例

摘要

A k-out-of-n system with number-dependent minimal repair is a system subject to shocks that arrive according to a non-homogeneous Poisson process with n independent identity components such that the system operates if and only if at least k of these n components operate successfully. Such a system is an important complex system and is used for mass transit, safety systems and computer systems. The long-run expected cost rate is obtained. The aim of the paper is to find the optimal number n~* of elements and the optimal age replacement time T~* which minimize the long-run expected cost per unit time of the policy. Various special cases are considered. Numerical examples are given to illustrate the method.
机译:具有数量依赖性最小修复的n个k出n的系统是受到冲击的系统,该冲击是根据具有n个独立标识分量的非均质Poisson过程到达的,因此,当且仅当其中至少k个,系统才能运行n个组件成功运行。这样的系统是重要的复杂系统,并且用于公共交通,安全系统和计算机系统。获得长期预期成本率。本文的目的是找到最优的元素数量n〜*和最优的寿命更换时间T〜*,从而使该策略每单位时间的长期预期成本最小化。考虑各种特殊情况。数值例子说明了该方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号