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

Standby redundancy allocation for series and parallel systems

Author

Listed:
  • Ravi Kumar
  • Sameen Naqvi

Abstract

The allocation of redundant components to a system is an efficient technique to improve its lifetime. In this article, we study the problem of two standby redundancy allocations for series and parallel systems, consisting of n-component (n≥2), in the sense of various stochastic orderings. It is assumed that components and redundancies follow a general lifetime distribution. For the case of allocating two redundancies to a series (parallel) system, we show that allocating the relatively stronger redundancy to the weaker component and the weaker redundancy to the stronger components can result in a system lifetime that is longer (shorter) in terms of the usual stochastic order. Moreover, various results associated with the hazard rate and reversed hazard rate orders are established. The outcomes of various papers are strengthened and generalized through our results. In addition, some applications are provided to illustrate our findings.

Suggested Citation

  • Ravi Kumar & Sameen Naqvi, 2025. "Standby redundancy allocation for series and parallel systems," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(2), pages 620-645, January.
    • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:2:p:620-645
    DOI: 10.1080/03610926.2024.2316270
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2316270
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2024.2316270?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:54:y:2025:i:2:p:620-645. 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.