The design of mission-based component test plans for series connection of subsystems
İ. Altinel,
Bora Çekyay,
Orhan Feyzio[gtilde]lu,
M. Keskin and
Süleyman Özekici
IISE Transactions, 2013, vol. 45, issue 11, 1202-1220
Abstract:
This article analyzes the mission-based component testing problem of devices which consist of series connection of 1-out-of-n subsystems or series connection of m-out-of-n subsystems. The device is designed to perform a mission that has a random sequence of phases with random durations. It is assumed that the deterioration of the components of the system is modulated by the mission process in such a way that the component failure rates depend on the phase that is performed. The objective is to find optimal component test times that yield desired levels of system reliability. An algorithmic procedure that is based on a column generation technique and d.c. programming is presented. This procedure eventually solves a semi-infinite linear program and it is illustrated by numerical examples. The existence of optimal component test times is discussed and sufficient conditions for the feasibility of the underlying semi-infinite linear programming model are determined.
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.733484 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:45:y:2013:i:11:p:1202-1220
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20
DOI: 10.1080/0740817X.2012.733484
Access Statistics for this article
IISE Transactions is currently edited by Jianjun Shi
More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().