The opportunistic replacement problem: analysis and case studies
Preprint, 2011

We consider an optimization model for determining optimal opportunistic maintenance (that is, component replacement) schedules when data is deterministic. This problem generalizes that of Dickman, Epstein, and Wilamowsky [21] and is a natural starting point for the modelling of replacement schedules when component lives are non-deterministic. We show that this basic opportunistic replacement problem is NP-hard. We show that the convex hull of the set of feasible replacement schedules is full-dimensional, and that all the necessary inequalities also are facet-inducing. We show that when maintenance occasions are fixed, the remaining problem can be stated as a linear program; when maintenance costs are monotone with time, the latter is solvable through a greedy procedure. Results from a series of case studies performed in the areas of aircraft engine and wind turbine maintenance are also reported. These illustrate the advantages of utilizing opportunistic maintenance activities based on a complete optimization model, as compared to simpler policies.

complexity analysis

opportunistic maintenance

replacement problem

polyhedral analysis

mixed binary linear programming

case studies

Författare

Torgny Almgren

Chalmers, Matematiska vetenskaper, Matematik

Göteborgs universitet

Niclas Andréasson

Michael Patriksson

Göteborgs universitet

Chalmers, Matematiska vetenskaper, Matematik

Ann-Brith Strömberg

Göteborgs universitet

Chalmers, Matematiska vetenskaper, Matematik

Adam Wojciechowski

Chalmers, Matematiska vetenskaper, Matematik

Göteborgs universitet

Drivkrafter

Hållbar utveckling

Styrkeområden

Transport

Energi

Ämneskategorier

Beräkningsmatematik

Fundament

Grundläggande vetenskaper

Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University: 2011:17

Mer information

Skapat

2017-10-07