Article ID: | iaor2001645 |
Country: | United Kingdom |
Volume: | 27 |
Issue: | 4 |
Start Page Number: | 321 |
End Page Number: | 333 |
Publication Date: | Apr 2000 |
Journal: | Computers and Operations Research |
Authors: | Love C.E., Zhang Z.G. |
Keywords: | markov processes |
A repairable system (machine) is subject to failure. At each failure epoch, a general repair is performed. Such repairs return the system to a working condition somewhere between ‘good-as-new’ (a perfect repair) and ‘bad as old’ (a minimal repair). An important question for such system is at what time should a major overhaul be conducted to return the unit to a ‘good-as-new’ state. Two polices are investigated in this research: (1) overhaul at fixed intervals and (2) overall at variable intervals by conducting each overhaul on the first failure following a predetermined time. We show in this research that both of these polices can be analyzed using a simple recursive Markov model thereby permitting the best of these policies to be identified in any particular situation. The Markov model is quite general, permitting a wide variety of structures to be investigated.