Threshold reliability of networks with small failure sets

DOI10.1002/net.3230250304zbMath0828.90049OpenAlexW1994983746MaRDI QIDQ4838201

J. Scott Provan, Michael O. Ball, Jane N. Hagstrom

Publication date: 20 July 1995

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/5388

zbMATH Keywords

project schedulingreliability analysisnetwork flow modeldirectional acyclic graphfailed arcstwo state arcs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (5)

Two-path subsets: Efficient counting and applications to performability analysis ⋮ Network reliability: Heading out on the highway ⋮ ON WEIGHTED K-OUT-OF-N SYSTEMS WITH STATISTICALLY DEPENDENT COMPONENT LIFETIMES ⋮ On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes ⋮ On the reliability modeling of weighted \(k\)-out-of-\(n\) systems with randomly chosen components

Cites Work

• On the structure of all minimum cuts in a network and applications

This page was built for publication: Threshold reliability of networks with small failure sets