When is greedy module assembly optimal?

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199012)37:6<847::AID-NAV3220370604>3.0.CO;2-Y" /><847::AID-NAV3220370604>3.0.CO;2-Y 10.1002/1520-6750(199012)37:6<847::AID-NAV3220370604>3.0.CO;2-YzbMath0716.90046OpenAlexW2085912217MaRDI QIDQ3204304

David M. Malon

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199012)37:6<847::aid-nav3220370604>3.0.co;2-y

zbMATH Keywords

coherent systemsseries structuregreedy assembly rule

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (6)

Preservation of transform orders under a semiparametric model and its mixture ⋮ Stochastic comparisons of series and parallel systems with randomized independent components ⋮ Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues ⋮ Importance measures in reliability and mathematical programming ⋮ A polytope approach to the optimal assembly problem ⋮ On the optimal assembly of series-parallel systems

Cites Work

• Inequalities: theory of majorization and its applications

This page was built for publication: When is greedy module assembly optimal?