Preventive Maintenance Models: Replacement, Repair, Ordering, and Inspection

Kaio, Naoto; Osaki, Shunji

doi:10.1007/1-85233-841-5_19

Cited by 12 publications

(3 citation statements)

References 76 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In preventive replacement, the system or unit is replaced by a new one before it fails. On the other hand, with corrective replacement it is the failed unit that is replaced [5].…”

Section: Mss Maintenance Optimizationmentioning

confidence: 99%

Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO

Zavala

Ramos

2012

Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

Several systems can perform their intended functions at more than two different levels, from perfectly working to completely failed. These kind of systems are known as multistate systems. In many complex and sophisticated systems, reliability and maintainability theory plays a very important role in maintaining such systems. The purpose of MSS maintenance optimization is to extend system lifetime, or at least the mean time to the next failure whose repair may be costly. Furthermore, it is expected that effective maintenance policies can increase system availability and reduce the consequences of unavailability (unaccomplished demand). In this study, we consider cyclic replacement policy in a preventive maintenance planning for a component subject to failure. This paper introduces a new approach based on PSO with constraints handling for MSS maintenance optimization problems. The universal generating function is applied in this work to evaluate MSS reliability. Our approach is tested in a real MSS maintenance problem in full measure in the state-of-the-art. The main advantage of the suggested approach is that it can be easily implemented in practice for maintenance of real MSS.

show abstract

“…In preventive replacement, the system or unit is replaced by a new one before it fails. On the other hand, with corrective replacement it is the failed unit that is replaced [5].…”

Section: Mss Maintenance Optimizationmentioning

confidence: 99%

Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO

Zavala

Ramos

2012

Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…To perform maintenance activities, it is crucial to effectively manage a crew of operators and sequence their visits over a planning horizon. Two main categories of maintenance can be distinguished [1]:…”

Section: Introductionmentioning

confidence: 99%

“…In the first case of TBM, the preventive replacement is performed at regular time intervals. For the ARP, the unit is replaced depending on its age or its remaining useful life [1]. CBM is based on the inspection of the unit or system before the intervention.…”

Section: Introductionmentioning

confidence: 99%

Multi-Objective Model and Variable Neighborhood Search Algorithms for the Joint Maintenance Scheduling and Workforce Routing Problem

et al. 2022

View full text Add to dashboard Cite

This paper addresses a problem faced by maintenance service providers: performing maintenance activities at the right time on geographically distributed machines subjected to random failures. This problem requires determining for each technician the sequence of maintenance operations to perform to minimize the total expected costs while ensuring a high level of machine availability. To date, research in this area has dealt with routing and maintenance schedules separately. This study aims to determine the optimal maintenance and routing plan simultaneously. A new bi-objective mathematical model that integrates both routing and maintenance considerations is proposed for time-based preventive maintenance. The first objective is to minimize the travel cost related to technicians’ routing. The second objective can either minimize the total preventive and corrective maintenance cost or the failure cost. New general variable neighborhood search (GVNS) and variable neighborhood descent (VND) algorithms based on the Pareto dominance concept are proposed and performed over newly generated instances. The efficiency of our approach is demonstrated through several experiments. Compared to the commercial solver and existing multi-objective VND and GVNS, these new algorithms obtain highly competitive results on both mono-objective and bi-objective variants.

show abstract

Cost-effective Analysis of Optimal Order-replacement Policies

Kaio

Osaki

Advances in Ranking and Selection, Multiple Comparisons, and Reliability

View full text Add to dashboard Cite

Preventive Maintenance Models: Replacement, Repair, Ordering, and Inspection

Cited by 12 publications

References 76 publications

Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO

Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO

Multi-Objective Model and Variable Neighborhood Search Algorithms for the Joint Maintenance Scheduling and Workforce Routing Problem

Cost-effective Analysis of Optimal Order-replacement Policies

Contact Info

Product

Resources

About