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

The competing risks analysis for parallel and series systems using Type-II progressive censoring

Author

Listed:
  • Leila Amiri
  • Mojtaba Ganjali
  • Reza Hashemi
  • Mojtaba Khazaei

Abstract

Recently, the study of the lifetime of systems in reliability and survival analysis in the presence of several causes of failure (competing risks) has attracted attention in the literature. In this paper, series and parallel systems with exponential lifetime for each item of the system are considered. Several causes of failure independently affect lifetime distributions and observations of failure times of the systems are considered under progressive Type-II censored scheme. For series systems, the maximum likelihood estimates of parameters are computed and confidence intervals for parameters of the model are obtained using Fisher information matrix. For parallel systems, the generalized EM algorithm which uses the Newton-Raphson algorithm inside the EM algorithm is used to compute the maximum likelihood estimates of parameters. Also, the standard errors of the maximum likelihood estimates are computed by using the supplemented EM algorithm. The simulation study confirms the good performance of the introduced approach.

Suggested Citation

  • Leila Amiri & Mojtaba Ganjali & Reza Hashemi & Mojtaba Khazaei, 2020. "The competing risks analysis for parallel and series systems using Type-II progressive censoring," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(22), pages 5598-5612, November.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:22:p:5598-5612
    DOI: 10.1080/03610926.2019.1620779
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1620779
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2019.1620779?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.

    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:49:y:2020:i:22:p:5598-5612. 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.