A heuristic maintenance scheduling framework for a military aircraft fleet under limited maintenance capacities
•A maintenance scheduling framework for a military aircraft fleet is developed.•Limited maintenance capacities and uncertain break are involved in this framework.•Structural dependence and operation constraints are jointly formulated.•Two iterated greedy heuristics are developed to resolve the probl...
Uloženo v:
| Vydáno v: | Reliability engineering & system safety Ročník 235; s. 109239 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.07.2023
|
| Témata: | |
| ISSN: | 0951-8320, 1879-0836 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | •A maintenance scheduling framework for a military aircraft fleet is developed.•Limited maintenance capacities and uncertain break are involved in this framework.•Structural dependence and operation constraints are jointly formulated.•Two iterated greedy heuristics are developed to resolve the problem.•A horizon splitting strategy enhances the algorithm's performance.
In many military scenarios, an aircraft fleet is oftentimes required to execute a sequence of missions with finite breaks between two adjacent missions. The performance of a fleet can be significantly improved by conducting appropriate maintenance activities on damaged aircraft during each break. The maintenance scheduling of such a scenario is, however, inherently subject to the limitation of maintenance capacities, such as repairpersons and repair facilities. Each maintenance activity contains multiple maintenance jobs that must be sequentially carried out, whereas the structural dependence of the constituent parts of each aircraft produces additional constraints to the sequence of maintenance activities. In this article, a new maintenance scheduling framework for a fleet of military aircraft is formulated to maximize the expected fleet readiness. Each maintenance activity requires specific repair facilities and repairpersons, and the limited maintenance capacities have to be arranged in a holistic manner. Due to the unexpected arrival of the next mission on battlefields, the uncertainty associated with the time duration of a break is also considered. Two heuristic algorithms are put forth to resolve the resulting optimization problem efficiently. Comparative studies show that the proposed heuristics outperform other alternative algorithms and are promising to solve large-scale problems. |
|---|---|
| ISSN: | 0951-8320 1879-0836 |
| DOI: | 10.1016/j.ress.2023.109239 |