A Markov decision algorithm for optimal inspections and revisions in a maintenance system with partial information

This paper deals with a gradually deteriorating equipment whose actual degree of deterioration can be revealed by inspections only. An inspection can be succeeded by a revision depending on the system's degree of deterioration. In the absence of inspections and revisions, the working condition...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 21; no. 2; pp. 245 - 253
Main Authors Tijms, H.C., van der Duyn Schouten, F.A.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.01.1985
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/0377-2217(85)90036-0

Cover

More Information
Summary:This paper deals with a gradually deteriorating equipment whose actual degree of deterioration can be revealed by inspections only. An inspection can be succeeded by a revision depending on the system's degree of deterioration. In the absence of inspections and revisions, the working condition of the system evolves according to a Markov chain whose changes of state are not observable with the possible exception of a breakdown. Examples of this model include production machines subject to stochastic breakdowns, and maintenance of communication systems. The cost structure of the model consists of inspection, revision and operating costs. It is intuitively reasonable that in many applications a simple control-limit rule will be optimal. Such a rule prescribes a revision only when inspection reveals that the degree of deterioration has exceeded some critical level. A special-purpose Markov decision algorithm operating on the class of control-limit rules is developed for the computation of an average cost optimal schedule of inspections and revisions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(85)90036-0