Article ID: | iaor2013280 |
Volume: | 76 |
Issue: | 3 |
Start Page Number: | 289 |
End Page Number: | 319 |
Publication Date: | Dec 2012 |
Journal: | Mathematical Methods of Operations Research |
Authors: | Patriksson Michael, Strmberg Ann-Brith, Wojciechowski Adam, Almgren Torgny, Andrasson Niclas, nnheim Magnus |
Keywords: | combinatorial optimization, scheduling, programming: linear |
We consider a model for determining optimal opportunistic maintenance schedules w.r.t. a maximum replacement interval. This problem generalizes that of Dickman et al. (1991) and is a natural starting point for modelling replacement schedules of more complex systems. We show that this basic opportunistic replacement problem is NP‐hard, that the convex hull of the set of feasible replacement schedules is full‐dimensional, that all the inequalities of the model are facet‐inducing, and present a new class of facets obtained through a