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

Optimal random replacement models with continuously processing jobs

Author

Listed:
  • Mingchih Chen

Abstract

In some practical situations, it would be impossible to conduct a replacement action for an operating system during the middle of a job and might be wise to wait until the completion of its operation. First, this paper considers age replacement policies for a system, which continuously works for multiple jobs with random working times. Next, the system can undergo minimal repairs upon failures and is replaced at the first completion of the working time over a planned time T. Finally, when a job incurs some damage to the system, the replacement model over time T is applied. The expected cost rates for these modified models are derived, and the optimal maintenance policies, which minimize the expected cost rates are obtained analytically. Copyright © 2012 John Wiley & Sons, Ltd.

Suggested Citation

  • Mingchih Chen, 2013. "Optimal random replacement models with continuously processing jobs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 29(2), pages 118-126, March.
  • Handle: RePEc:wly:apsmbi:v:29:y:2013:i:2:p:118-126
    DOI: 10.1002/asmb.952
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.952
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asmb.952?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
    ---><---

    Citations

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


    Cited by:

    1. 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).

    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:29:y:2013:i:2:p:118-126. 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.