IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v48y2016i11p1016-1026.html
   My bibliography  Save this article

Calendar-based age replacement policy with dependent renewal cycles

Author

Listed:
  • Maliheh Aramon Bajestani
  • Dragan Banjevic

Abstract

In this article, we introduce an age-based replacement policy in which the preventive replacements are restricted to specific calendar times. Under the new policy, the assets are renewed at failure or if their ages are greater than or equal to a replacement age at given calendar times, whichever occurs first. This policy is logistically applicable in industries such as utilities where there are large and geographically diverse populations of deteriorating assets with different installation times. Since preventive replacements are performed at fixed times, the renewal cycles are dependent random variables. Therefore, the classic renewal reward theorem cannot be directly applied. Using the theory of Markov chains with general state space and a suitably defined ergodic measure, we analyze the problem to find the optimal replacement age, minimizing the long-run expected cost per time unit. We further find the limiting distributions of the backward and forward recurrence times for this policy and show how our ergodic measure can be used to analyze more complicated policies. Finally, using a real data set of utility wood poles’ maintenance records, we numerically illustrate some of our results including the importance of defining an appropriate ergodic measure in reducing the computational expense.

Suggested Citation

  • Maliheh Aramon Bajestani & Dragan Banjevic, 2016. "Calendar-based age replacement policy with dependent renewal cycles," IISE Transactions, Taylor & Francis Journals, vol. 48(11), pages 1016-1026, November.
  • Handle: RePEc:taf:uiiexx:v:48:y:2016:i:11:p:1016-1026
    DOI: 10.1080/0740817X.2016.1163444
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2016.1163444
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2016.1163444?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jun Wang & Yuyang Wang & Yuqiang Fu, 2023. "Joint Optimization of Condition-Based Maintenance and Performance Control for Linear Multi-State Consecutively Connected Systems," Mathematics, MDPI, vol. 11(12), pages 1-19, June.
    2. Sheu, Shey-Huei & Tsai, Hsin-Nan & Sheu, Uan-Yu & Zhang, Zhe George, 2019. "Optimal replacement policies for a system based on a one-cycle criterion," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    3. Pinciroli, Luca & Baraldi, Piero & Ballabio, Guido & Compare, Michele & Zio, Enrico, 2022. "Optimization of the Operation and Maintenance of renewable energy systems by Deep Reinforcement Learning," Renewable Energy, Elsevier, vol. 183(C), pages 752-763.
    4. Pinciroli, Luca & Baraldi, Piero & Zio, Enrico, 2023. "Maintenance optimization in industry 4.0," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    5. de Jonge, Bram & Scarf, Philip A., 2020. "A review on maintenance optimization," European Journal of Operational Research, Elsevier, vol. 285(3), pages 805-824.
    6. Yonit Barron & Uri Yechiali, 2017. "Generalized control-limit preventive repair policies for deteriorating cold and warm standby Markovian systems," IISE Transactions, Taylor & Francis Journals, vol. 49(11), pages 1031-1049, November.

    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:taf:uiiexx:v:48:y:2016:i:11:p:1016-1026. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.