Condition-based maintenance for multi-component systems: Modeling, structural properties, and algorithms

Condition-Based Maintenance (CBM) is an effective maintenance strategy to improve system performance while lowering operating and maintenance costs. Real-world systems typically consist of a large number of components with various interactions among components. However, existing studies on CBM mainl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IISE transactions Jg. 53; H. 1; S. 88 - 100
Hauptverfasser: Zhu, Zhicheng, Xiang, Yisha
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 02.01.2021
Schlagworte:
Condition-based maintenance
endogenous uncertainty
multi-component systems
multi-stage stochastic integer programming
ISSN:2472-5854, 2472-5862
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Condition-Based Maintenance (CBM) is an effective maintenance strategy to improve system performance while lowering operating and maintenance costs. Real-world systems typically consist of a large number of components with various interactions among components. However, existing studies on CBM mainly focus on single-component systems. Multi-component CBM, which joins the components' stochastic degradation processes and the combinatorial maintenance grouping problem, remains an open issue in the literature. In this article, we study the CBM optimization problem for multi-component systems. We first develop a multi-stage stochastic integer model with the objective of minimizing the total maintenance cost over a finite planning horizon. We then investigate the structural properties of a two-stage model. Based on the structural properties, two efficient algorithms are designed to solve the two-stage model. Algorithm 1 solves the problem to its optimality and Algorithm 2 heuristically searches for high-quality solutions based on Algorithm 1 . Our computational studies show that Algorithm 1 obtains optimal solutions in a reasonable amount of time and Algorithm 2 can find high-quality solutions quickly. The multi-stage problem is solved using a rolling horizon approach based on the algorithms for the two-stage problem. Supplementary materials are available for this article. Go to the publisher's online edition of IISE Transaction, datasets, additional tables, detailed proofs, etc.
ISSN:2472-5854
2472-5862
DOI:10.1080/24725854.2020.1741740