IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v44y2012i11p964-973.html
   My bibliography  Save this article

Element maintenance and allocation for linear consecutively connected systems

Author

Listed:
  • Rui Peng
  • Min Xie
  • Szu Ng
  • Gregory Levitin

Abstract

This article considers optimal maintenance and allocation of elements in a Linear Multi-state Consecutively Connected System (LMCCS), which is important in signal transmission and other network systems. The system consists of N+1 linearly ordered positions (nodes) and fails if the first node (source) is not connected with the final node (sink). The reliability of an LMCCS has been studied in the past but has been restricted to the case when each system element has a constant reliability. In practice, system elements usually fail with increasing failure probability due to aging effects. Furthermore, in order to increase system availability, resources can be put into the maintenance of each element to increase the availability of the element. In this article, a framework is proposed to solve the cost optimal maintenance and allocation strategy of this type of system subject to an availability requirement. A universal generating function is used to estimate the availability of the system. A genetic algorithm is adopted for optimization. Illustrative examples are presented.

Suggested Citation

  • Rui Peng & Min Xie & Szu Ng & Gregory Levitin, 2012. "Element maintenance and allocation for linear consecutively connected systems," IISE Transactions, Taylor & Francis Journals, vol. 44(11), pages 964-973.
    • Handle: RePEc:taf:uiiexx:v:44:y:2012:i:11:p:964-973
    DOI: 10.1080/0740817X.2011.649388
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2011.649388
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2011.649388?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:uiiexx:v:44:y:2012:i:11:p:964-973. 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/uiie .

    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.