A branch-and-bound approach for spare unit allocation in a series system

DOI10.1016/0377-2217(94)90195-3zbMath0809.90056OpenAlexW1983528449MaRDI QIDQ1333525

V. Pereyra

Publication date: 28 March 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90195-3

zbMATH Keywords

branch-and-boundavailabilityfathoming mechanismsquare unit allocation model

Mathematics Subject Classification ID

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

Related Items

Theorem proving modulo, Reliability optimization of a series system with multiple-choice and budget constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Successive approximation in separable programming: An improved procedure for convex separable programs
• A New Algorithm for the 0-1 Knapsack Problem
• k-out-of-m system availability with minimum-cost allocation spares
• Near-Optimal Service Constrained Stocking Policies for Spare Parts
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Reliability Optimization by Generalized Lagrangian-Function and Reduced-Gradient Methods
• Poisson Arrivals See Time Averages
• Technical Note—A Note on the Busy Period of an M/G/1 Finite Queue
• Optimization of System Reliability by Branch-and-Bound
• Optimization Techniques for System Reliability with RedundancyߞA Review
• System Availability and Optimum Spare Units
• Probabilistic Analysis of a Two-Unit System with a Warm Standby and a Single Repair Facility
• Integer Programming Formulation of Constrained Reliability Problems