Skip to main content
SpringerLink
Log in

Reliability considerations for process network synthesis problems

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

A manufacturing system consists of operating units which convert their input materials into their output materials. In the problem of designing a process network, we have to find a suitable network of operating units which produces the desired products from the given raw materials. If we consider this process network design problem from a structural point of view, then minimizing the cost of the network leads to an NP-complete combinatorial optimization problem called Process Network Synthesis or PNS problem. In this paper we define an extension of the PNS problem, where probability of failure, operating time and repair time are assigned to the operating units, and some costs are assigned to the system. We provide algorithms that determine the probability of system failure, the operating units which should be used, and the scheduling of the reparation of operating units in order to obtain expected optimal operation of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Blázsik Z, Imreh B (1996) A note on connection between PNS and set covering problems. Acta Cybern 12:309–312

    Google Scholar 

  • Blázsik Z, Holló Cs, Imreh Cs, Kovács Z (2000a) On Bottleneck and ksum version of the process network synthesis problem. Novi Sad J Math 3:11–19

  • Blázsik Z, Holló Cs, Imreh B, Imreh Cs, Kovács Z (2000b) On a well-solvable class of the PNS problem. Novi Sad J Math 30:21–30

  • Blźsik Z, Holló Cs, Imreh Cs, Kovács Z (2001) Heuristics for the process network synthesis problem. Optim Theory Recent Dev Matrahaza 59:1–17

  • Dasdan A, Gupta RK (1998) Faster maximum and minimum mean cycle algorithms for system performance analysis. IEEE Trans Comput Aid Des 17:10

    Article  Google Scholar 

  • Dasdan A, Irani SS, Gupta RK (1999) Algorithms for optimum cycle mean and optimum cost to time ratio problems, DAC ’99. In: Proceedings of the 36th annual ACM/IEEE design automation conference. ACM New York, NY, USA, pp 37–42

  • Friedler F, Tarján K, Huang YW, Fan LT (1992) Combinatorial algorithms for process synthesis. Comput Chem Eng 16:313–320

    Article  Google Scholar 

  • Friedler F, Tarján K, Huang YW, Fan LT (1992) Graph-theoretic approach to process synthesis: axioms and theorems. Chem Eng Sci 47(8):1973–1988

    Article  Google Scholar 

  • Friedler F, Tarján K, Huang YW, Fan LT (1993) Graph-theoretic approach to process aynthesis: polynomial algorithm for maximal structure generation. Comput Chem Eng 17:924–942

    Article  Google Scholar 

  • Friedler F, Fan LT, Imreh B (1998) Process network synthesis: problem definition. Networks 28:119–124

    Article  Google Scholar 

  • Fülöp J, Friedler F, Imreh B (1998) On the reformulation of some classes of PNS problems as set covering problems. Acta Cybern 13:329–337

    Google Scholar 

  • Holló Cs, Blázsik Z, Imreh Cs, Kovács Z (1999) On a merging reduction of the process network synthesis problem. Acta Cybern 14:251–262

  • Holló Cs (2000) A look ahead branch-and-bound procedure for solving PNS problems. PUMA 11(2): 265–279

    Google Scholar 

  • Holló Cs (2002) A procedure based on automaton theory approach for solving modified PNS problems. PUMA 13(1–2):159–169

    Google Scholar 

  • Holló Cs (2003) A partial enumeration algorithm for solving PNS problems. Math Comput Model Hung Appl Math Comput Appl 38(7–9):855–864

    Google Scholar 

  • Holló Cs, Imreh B, Imreh Cs (2009) Reduction techniques for the PNS problems: a novel technique and a review. Optim Eng, Springer Netherlands 10(3):351–361

  • Imreh B, Friedler F, Fan LT (1996) An algorithm for improving the bounding procedure in solving process network synthesis by a branch-and-bound method. In: Bonze IM, Csendes T, Horst R, Pardalos PM (eds) Developments in global optimization. Kluwer Academic Publisher, Dordrecht, pp 301–348

    Google Scholar 

  • Imreh B, Magyar G (1998) Empirical analysis of some procedures for solving process network synthesis problem. J Comput Inf Technol CIT-6:373–382

    Google Scholar 

  • Minoux M (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19:313–360

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering, University of Szeged, Dugonics Square 13, 6720 , Szeged, Hungary

    Csaba Holló

Authors
  1. Csaba Holló
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Csaba Holló.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Holló, C. Reliability considerations for process network synthesis problems. Cent Eur J Oper Res 21, 887–899 (2013). https://doi.org/10.1007/s10100-013-0329-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-013-0329-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation