IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v16y2000i3p219-234.html
   My bibliography  Save this article

Stationary availability of a semi‐Markov system with random maintenance

Author

Listed:
  • Sophie Bloch‐Mercier

Abstract

We consider a reparable system with a finite state space, evolving in time according to a semi‐Markov process. The system is stopped for it to be preventively maintained at random times for a random duration. Our aim is to find the preventive maintenance policy that optimizes the stationary availability, whenever it exists. The computation of the stationary availability is based on the fact that the above maintained system evolves according to a semi‐regenerative process. As for the optimization, we observe on numerical examples that it is possible to limit the study to the maintenance actions that begin at deterministic times. We demonstrate this result in a particular case and we study the deterministic maintenance policies in that case. In particular, we show that, if the initial system has an increasing failure rate, the maintenance actions improve the stationary availability if and only if they are not too long on the average, compared to the repairs ( a bound for the mean duration of the maintenance actions is provided). On the contrary, if the initial system has a decreasing failure rate, the maintenance policy lowers the stationary availability. A few other cases are studied. Copyright © 2000 John Wiley & Sons, Ltd.

Suggested Citation

  • Sophie Bloch‐Mercier, 2000. "Stationary availability of a semi‐Markov system with random maintenance," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 16(3), pages 219-234, July.
    • Handle: RePEc:wly:apsmbi:v:16:y:2000:i:3:p:219-234
    DOI: 10.1002/1526-4025(200007/09)16:33.0.CO;2-4
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1526-4025(200007/09)16:33.0.CO;2-4
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1526-4025(200007/09)16:33.0.CO;2-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:16:y:2000:i:3:p:219-234. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.