Synthesis algorithms for the reliability analysis of processing systems

Z. Kovacs, A. Orosz, F. Friedler

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Reliability is naturally one of the most important properties of processing systems, still there is no general method that is capable of simultaneously considering the reliability during the design procedure. Consequently, the optimality of the decisions in process design cannot be guaranteed. The main reason of the lack of general method is that the process design and the reliability engineering are based on different types of mathematical modelling tools. While process design traditionally considered as mixed-integer optimization, reliability engineering is based on probability theory, therefore, a general modelling tool is required that can conveniently cover these two areas. In the present work, it has been shown that the formerly developed combinatorial approach to process network synthesis, the so-called P-graph framework, can conveniently cover and integrate these two areas. The method for reliability analysis of processing systems is general and can effectively analyze complex, highly interconnected networks. Furthermore, the reliability analysis method given here can be embedded to process design tools. A formerly unavailable formula, the system reliability formula has also been defined for processing networks. The focus of the present work is on structures of processing systems, all statements and algorithms are general and proved. The solutions of challenging real problems are also given.

Original languageEnglish
JournalCentral European Journal of Operations Research
DOIs
Publication statusAccepted/In press - Jan 1 2018

    Fingerprint

Keywords

  • P-graph
  • Processing systems
  • Reliability analysis

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this