Number of the records: 1  

Effective computing algorithm for maintenance optimization of highly reliable systems

  1. 1.
    0386704 - ÚGN 2013 RIV GB eng J - Journal Article
    Briš, R. - Byczanski, Petr
    Effective computing algorithm for maintenance optimization of highly reliable systems.
    Reliability Engineering & System Safety. Roč. 109, č. 1 (2013), s. 77-85. ISSN 0951-8320. E-ISSN 1879-0836
    R&D Projects: GA MŠMT(CZ) ED1.1.00/02.0070
    Institutional support: RVO:68145535
    Keywords : exact computing * maintenance * optimization * unavailability
    Subject RIV: BA - General Mathematics
    Impact factor: 2.048, year: 2013
    http://www.sciencedirect.com/science/article/pii/S0951832012001639

    This paper describes a new iterative numerical algorithm for optimal maintenance strategy respecting a given reliability constraint. It stems from the previous author's research work which brings a new direct analytical method that enables exact reliability quantifications of highly reliable systems with maintenance (both preventive and corrective), i.e. the instantaneous unavailability function is computed in full machine accuracy. The method takes into account systems with highly reliable and maintained components, including repairable components undergoing to hidden failures. The new numerical algorithm for maintenance optimization introduced in this article fully respects previously developed exact computing methodology to solve a cost optimization problem where decision variable is maintenance. The algorithm, which is based on merits of a high performance language for technical computing MATLAB, results from linear approximation of total system cost that is supposed to be a linear function of frequency of maintenance and from limiting unavailability approximation in each iteration step.
    Permanent Link: http://hdl.handle.net/11104/0219303

     
    FileDownloadSizeCommentaryVersionAccess
    UGN_0386704.pdf1834.4 KBAuthor´s preprintopen-access
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.