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

Allocation strategies of standby redundancies in series/parallel system

Author

Listed:
  • Jianbin Chen
  • Yiying Zhang
  • Peng Zhao
  • Shan Zhou

Abstract

This article deals with the topic of optimal allocation of two standby redundancies in a two-component series/parallel system. There are two original components C1 and C2 which can be used to construct a series/parallel system, and two spares R1 (same as C1) and R2 (different from both C1 and C2) at hand with them being standby redundancies so as to enhance the reliability level of the system. The goal for an engineer is to seek after the optimal allocation policy in this framework. It is shown that, for the series structure, the engineer should allocate R2 to C1 and R1 to C2 provided that C1 (or R1) performs either the best or worst among all the units; otherwise, the allocation policy should be reversed. For the parallel structure, the optimal allocation strategy is just opposed to that of series case. We also provide some numerical examples for illustrating the theoretical results.

Suggested Citation

  • Jianbin Chen & Yiying Zhang & Peng Zhao & Shan Zhou, 2018. "Allocation strategies of standby redundancies in series/parallel system," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(3), pages 708-724, February.
    • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:3:p:708-724
    DOI: 10.1080/03610926.2017.1313984
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1313984
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2017.1313984?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:47:y:2018:i:3:p:708-724. 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.