A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems

DOI10.1016/S0305-0548(03)00094-7zbMath1073.90011OpenAlexW2057152336WikidataQ115023232 ScholiaQ115023232MaRDI QIDQ1885986

James Flynn, Chia-Shin Chung

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00094-7

zbMATH Keywords

ReliabilityReplacement policiesHeuristic algorithmConsecutive \(k\)-out-of-\(n\)Multicomponent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

RELIABILITY EVALUATION OF LINEAR CONSECUTIVE-WEIGHTED-k-OUT-OF-n:F SYSTEM ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems ⋮ JOINT MAINTENANCE AND SPARE COMPONENT PROVISIONING POLICY FOR k-OUT-OF-n SYSTEMS

Cites Work

• Unnamed Item
• Optimal replacement policies for a multicomponent reliability system
• A survey of maintenance policies of deteriorating systems
• Optimal maintenance models for systems subject to failure–A Review
• Reliability of Consecutive-k-out-of-n:F System
• Fast Solutions for Consecutive-k-out-of-n: F System
• A survey of maintenance models: The control and surveillance of deteriorating systems
• Optimum Allocation of Components in a Special 2-Port Network
• A heuristic algorithm for determining replacement policies ink-out-of-n systems
• A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
• A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems

This page was built for publication: A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems