Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

نویسندگان

چکیده مقاله:

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preventive Maintenance Policy for Linear Consecutive-k-out-of-n: F System

Linear consecutive-k-out-of-n: F systems are considered. It is assumed that the components are independent and the component failure times follow an exponential distribution with identical failure rate. It is also assumed that there are only two component states (working and failed) and we can know the component state at any time. If there is at least one minimal cut set consisting of one worki...

متن کامل

Availability Optimization of a Series Repairable System with Multiple k-out-of-n Subsystems

An availability model is developed to optimize the availability of a series repairable system with multiple k-out-of-n subsystems in this paper. There are two types of decision variables that determine the system designer’s decision to allocate the number of repairmen and to allocate the number of redundant components in each subsystem in the presence of weight, volume and cost constraint...

متن کامل

Availability of k-out-of-n: F Secondary Subsystem with General Repair Time Distribution

In this paper we study the steady state availability of main k-out-of-n: F and secondary subsystems having general repair time distribution. When more than k units of main subsystem fail, then the main subsystem shuts off the secondary subsystem. The life time distributions of the main units and that of secondary subsystem are exponentially distributed. A repair facility having single repairman...

متن کامل

Proposal of Simulated Annealing Algorithms for Optimal Arrangement in a Circular Consecutive-k-out-of-n: F System

A circular consecutive-k-out-of-n: F system consists of n components arranged along a circular path. This system fails if and only if k or more consecutive components fail. As the number of components n increases, the amount of calculation to solve optimal component arrangement problems in this kind of system exactly would be too much. In this paper, we propose two types of simulated annealing ...

متن کامل

Condition-based Maintenance Problem of a Consecutive-k-out-of-n: F System with Load-Sharing Dependent Components

A maintenance problem of a linear consecutivek-out-of-n: F system with load-sharing dependent components is considered. This system consists of n components which are arranged linearly and fails if k consecutive components fail [1]. This system is commonly found in the integrated circuits, relay stations in telecommunication system, oil pipeline system, vacuum system in accelerators, and spacec...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 2

صفحات  161- 174

تاریخ انتشار 2008-03

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023