Reliability - Redundancy allocation in process graphs

Zoltán Süle, János Baumgartner, J. Abonyi

Research output: Article

5 Citations (Scopus)

Abstract

Process graphs (P-graphs) have been proven to be useful in identifying optimal structures of process systems and business processes. The provision of redundant critical units can significantly reduce operational risk. Redundant units and subsystems can be modelled in P-graphs by adding nodes that represent logical conditions of the operation of the units. It is revealed in this paper that P-graphs extended by logical condition units can be transformed into reliability block diagrams and based on the cut sets and path sets of the graph a polynomial risk model can be extracted. Since the exponents of the polynomial represent the number of redundant units, the cost function of the reliability - redundancy allocation problem as a nonlinear integer programming model can be formalised, where the cost function handles the costs associated with consequences of equipment failure and repair times. The applicability of this approach is illustrated in a case study related to the asset-intensive chemical, oil, gas and energy sector. The results show that the proposed algorithm is useful for risk-based priority resource allocation in a reforming reaction system.

Original languageEnglish
Pages (from-to)991-996
Number of pages6
JournalChemical Engineering Transactions
Volume70
DOIs
Publication statusPublished - jan. 1 2018

ASJC Scopus subject areas

  • Chemical Engineering(all)

Fingerprint Dive into the research topics of 'Reliability - Redundancy allocation in process graphs'. Together they form a unique fingerprint.

  • Cite this