Search: onr:"swepub:oai:gup.ub.gu.se/162877" >
The opportunistic r...
The opportunistic replacement problem: theoretical analyses and numerical tests
-
- Almgren, Torgny, 1962 (author)
- Volvo Group
-
Andréasson, Niclas, 1976 (author)
-
- Patriksson, Michael, 1964 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
-
show more...
-
- Strömberg, Ann-Brith, 1961 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,Chalmers tekniska högskola,Chalmers University of Technology,University of Gothenburg
-
- Wojciechowski, Adam, 1982 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,Chalmers tekniska högskola,Chalmers University of Technology,University of Gothenburg
-
- Önnheim, Magnus, 1985 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,Chalmers tekniska högskola,Chalmers University of Technology,University of Gothenburg
-
show less...
-
(creator_code:org_t)
- 2012-08-26
- 2012
- English.
-
In: Mathematical Methods of Operations Research. - : Springer Science and Business Media LLC. - 1432-2994 .- 1432-5217. ; 76:3, s. 289-319
- Related links:
-
https://gup.ub.gu.se...
-
show more...
-
https://doi.org/10.1...
-
https://research.cha...
-
show less...
Abstract
Subject headings
Close
- We consider a model for determining optimal opportunistic maintenance schedules with respect to a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165–175, 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 {0,1/2}-Chvátal–Gomory rounding. For costs monotone with time, a class of elimination constraints is introduced to reduce the computation time; it allows maintenance only when the replacement of at least one component is necessary. For costs decreasing with time, these constraints eliminate non-optimal solutions. When maintenance occasions are fixed, the remaining problem is stated as a linear program and solved by a greedy procedure. Results from a case study on aircraft engine maintenance illustrate the advantage of the optimization model over simpler policies. We include the new class of facets in a branch-and-cut framework and note a decrease in the number of branch-and-bound nodes and simplex iterations for most instance classes with time dependent costs. For instance classes with time independent costs and few components the elimination constraints are used favorably. For fixed maintenance occasions the greedy procedure reduces the computation time as compared with linear programming techniques for all instances tested.
Subject headings
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Keyword
- Maintenance optimization
- Mixed integer programming
- Complexity analysis
- Polyhedral analysis
- Mixed integer programming
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database