On the optimal assembly of series-parallel systems

Authors:
Laurence A Baxter;Farid Harche
Affiliations:
Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, NY 11794, USA;Department of Statistics and Operations Research, New York University, 40 West 4th Street, New York, NY 10003, USA
Venue:
Operations Research Letters
Year:
1992

Citing 5
Cited 1

Optimal consecutive-2-out-of-n systems

Mathematics of Operations Research
Optimal assignment of components to a two-stage k-out-of-n system

Mathematics of Operations Research
Optimal assembly of an s-Stage k-Out-of-n system

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Redundant consecutive-k systems

Operations Research Letters

Using APPM-trained ANN to solve stochastic expected value mode

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic for the optimal assembly of series-parallel systems is proposed. An asymptotic optimality property of this heuristic is derived by means of a probabilistic analysis. Bounds on the absolute and relative errors of an arbitrary heuristic for the optimal assembly of series-parallel systems are calculated.