An exact algorithm for the reliability redundancy allocation problem
From MaRDI portal
Publication:319293
DOI10.1016/j.ejor.2015.01.008zbMath1346.90268OpenAlexW2022123067MaRDI QIDQ319293
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.008
Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (8)
A discrete-binary transformation of the reliability redundancy allocation problem ⋮ Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ Determining reliable networks of prepositioning materiel warehouses for public-sector rapid response supplies ⋮ Optimal allocation policy of one redundancy in a \(n\)-component series system ⋮ Heterogeneous standby systems with shocks-driven preventive replacements ⋮ MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components ⋮ Optimization of reliability redundancy allocation problem with component mixing and strategy selection for subsystems ⋮ An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy
Cites Work
- Unnamed Item
- An efficient heuristic for reliability design optimization problems
- Tabu search-based metaheuristic algorithm for software system reliability problems
- On the computational complexity of reliability redundancy allocation in a series system
- The multidimensional 0-1 knapsack problem: an overview.
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Cold vs. hot standby mission operation cost minimization for 1-out-of-\(N\) systems
- An efficient heuristic for series-parallel redundant reliability problems
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
- Optimal Allocation of Redundant Components for Large Systems
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Two Constraints
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Reliability Optimization Problems with Multiple Constraints
- A differential evolution algorithm to solve redundancy allocation problems
This page was built for publication: An exact algorithm for the reliability redundancy allocation problem