Search: onr:"swepub:oai:gup.ub.gu.se/89029" >
The replacement pro...
The replacement problem: A polyhedral and complexity analysis. The complete version
-
Almgren, Torgny, 1962 (author)
-
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,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
-
- 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
-
show less...
-
(creator_code:org_t)
- 2009
- English.
- Related links:
-
https://gup.ub.gu.se...
-
show more...
-
https://research.cha...
-
https://research.cha...
-
https://gup.ub.gu.se...
-
show less...
Abstract
Subject headings
Close
- We consider an optimization model for determining optimal opportunistic maintenance (that is, component replacement) schedules when data is deterministic. This problem, which generalizes that of Dickman et al., is a natural starting point for the modelling of replacement schedules when component lives are non-deterministic, whence a mathematical study of the model is of large interest. We show that the convex hull of the set of feasible replacement schedules is full-dimensional, and that all the necessary inequalities are facet-inducing. Additional facets are then provided through Chvatal-Gomory rounding. We show that when maintenance occasions are fixed, the remaining problem reduces to a linear program; in some cases the latter is solvable through a greedy procedure. We further show that this basic replacement problem is NP-hard.
Subject headings
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Keyword
- mixed binary linear programming
- polyhedral analysis
- complexity analysis
- opportunistic maintenance
- replacement problem
- opportunistic maintenance
Publication and Content Type
- vet (subject category)
- ovr (subject category)
To the university's database