Published December 2019 | Version v1
Journal article

Robust allocation of testing resources in reliability growth

  • 1. Department of Industrial Engineering, University of Arkansas, 4207 Bell Engineering Center, Fayetteville, AR, 72701 (United States)

Description

Highlights: • Robust optimization (RO) is used to allocate reliability growth testing resources. • Cutting-plane algorithms are given for series and series-parallel systems. • The series system algorithm has a convex master problem and polynomial subproblems. • Construction of the RO model is illustrated using preliminary test data. • The RO may reduce the chance of obtaining test plans that yield a low reliability. -- Abstract: Reliability growth testing seeks to improve system reliability by identifying and removing failure modes. Recent models maximize system reliability by allocating limited testing resources across the system's components, each of which exhibits reliability growth according to the AMSAA model (Crow, 1974) with known parameters. We extend this research to solve a robust version of this problem for both series and series-parallel systems in which AMSAA parameters are uncertain but assumed to lie within a budget-restricted uncertainty set. We develop and analyze an exact solution approach for this problem based on a cutting-plane algorithm. In the case of series systems, we demonstrate that the subproblems from this algorithm are efficiently solvable via dynamic programming. Computational results demonstrate (i) the value of the robust optimization approach as compared to deterministic alternatives and (ii) the efficacy of our algorithm.

Additional details

Identifiers

DOI
10.1016/j.ress.2017.11.026;
PII
S0951832016310407;

Publishing Information

Journal Title
Reliability Engineering and System Safety
Journal Volume
192
Journal Page Range
vp.
ISSN
0951-8320
CODEN
RESSEP

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
55016989
Subject category
S42: ENGINEERING;
Descriptors DEI
ALGORITHMS; CONSTRUCTION; CUTTING; DYNAMIC PROGRAMMING; EXACT SOLUTIONS; OPTIMIZATION; POLYNOMIALS; PROGRAMMING
Descriptors DEC
CALCULATION METHODS; FUNCTIONS; MACHINING; MATHEMATICAL LOGIC; MATHEMATICAL SOLUTIONS

Optional Information

Copyright
Copyright (c) 2017 Elsevier Ltd. All rights reserved.