Premium
Checking policy for deteriorating multistate systems
Author(s) -
Karpiński Janusz
Publication year - 1988
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198804)35:2<259::aid-nav3220350210>3.0.co;2-5
Subject(s) - state (computer science) , model checking , computer science , unit (ring theory) , mathematics , algorithm , mathematics education
In this article a multistate system under some checking policy is considered. The system has n + 1 states: 0,1, …, n , and deteriorates gradually. State 0 is a normal (full capacity) state and states 1, …, n are considered unsatisfactory. Transition from state 0 to state 1 is considered a system failure. This failure can be detected only through checking, which entails a fixed cost c . The holding time in the undiscovered state i ( i = 1, …, n ) results in cost d i per unit of time. For such a system, the algorithm of determining optimum checking times is given.