IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v48y2019i3p676-688.html
   My bibliography  Save this article

Optimal scheduling replacement policies for a system with multiple random works

Author

Listed:
  • Yen-Luan Chen

Abstract

From the economical viewpoint in reliability theory, this paper addresses a scheduling replacement problem for a single operating system which works at random times for multiple jobs. The system is subject to stochastic failure which results the imperfect maintenance activity based on some random failure mechanism: minimal repair due to type-I (repairable) failure, or corrective replacement due to type-II (non-repairable) failure. Three scheduling models for the system with multiple jobs are considered: a single work, N tandem works, and N parallel works. To control the deterioration process, the preventive replacement is planned to undergo at a scheduling time T or the job's completion time of for each model. The objective is to determine the optimal scheduling parameters (T* or N*) that minimizes the mean cost rate function in a finite time horizon for each model. A numerical example is provided to illustrate the proposed analytical model. Because the framework and analysis are general, the proposed models extend several existing results.

Suggested Citation

  • Yen-Luan Chen, 2019. "Optimal scheduling replacement policies for a system with multiple random works," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(3), pages 676-688, February.
    • Handle: RePEc:taf:lstaxx:v:48:y:2019:i:3:p:676-688
    DOI: 10.1080/03610926.2017.1417434
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1417434
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2017.1417434?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. Levitin, Gregory & Xing, Liudong & Dai, Yanshun, 2021. "Joint optimal mission aborting and replacement and maintenance scheduling in dual-unit standby systems," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    2. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2021. "Optimal operation and maintenance scheduling in m-out-of-n standby systems with reusable elements," Reliability Engineering and System Safety, Elsevier, vol. 211(C).
    3. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2021. "Influence of storage on mission success probability of m-out-of-n standby systems with reusable elements," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    4. Levitin, Gregory & Xing, Liudong & Dai, Yanshun, 2022. "Minimum cost replacement and maintenance scheduling in dual-dissimilar-unit standby systems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    5. Xufeng Zhao & Mingchih Chen & Toshio Nakagawa, 2022. "Periodic replacement policies with shortage and excess costs," Annals of Operations Research, Springer, vol. 311(1), pages 469-487, April.
    6. Levitin, Gregory & Xing, Liudong & Xiang, Yanping, 2021. "Optimal multiple replacement and maintenance scheduling in two-unit systems," Reliability Engineering and System Safety, Elsevier, vol. 213(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:taf:lstaxx:v:48:y:2019:i:3:p:676-688. 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/lsta .

    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.