Reliability analysis of a simple replicated and-fork/and-join graph

DOI10.1016/0167-6377(94)90022-1zbMath0812.90056OpenAlexW2152211037MaRDI QIDQ1342096

Rong-Hong Jan, De-Ron Liang

Publication date: 15 May 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90022-1

zbMATH Keywords

reliabilityNP-completetask graphfork-join graphs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs

Cites Work

• Linear time algorithms for NP-hard problems restricted to partial k- trees
• A Survey of Network Reliability and Domination Theory
• Computational Complexity of Network Reliability Analysis: An Overview

This page was built for publication: Reliability analysis of a simple replicated and-fork/and-join graph