Search: onr:"swepub:oai:research.chalmers.se:53b3159d-793b-40bb-937c-56e8f19945ae" >
The stochastic oppo...
The stochastic opportunistic replacement problem, part III: improved bounding procedures
-
- Laksman, Efraim, 1983 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper,Department of Mathematical Sciences
-
- Strömberg, Ann-Brith, 1961 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper,Department of Mathematical Sciences
-
- Patriksson, Michael, 1964 (author)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper,Department of Mathematical Sciences
-
(creator_code:org_t)
- 2019-06-05
- 2020
- English.
-
In: Annals of Operations Research. - : Springer Science and Business Media LLC. - 1572-9338 .- 0254-5330. ; 292:2, s. 711-733
- Related links:
-
https://research.cha... (primary) (free)
-
show more...
-
https://link.springe...
-
https://research.cha...
-
https://doi.org/10.1...
-
https://research.cha...
-
https://gup.ub.gu.se...
-
show less...
Abstract
Subject headings
Close
- We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Samhällsbyggnadsteknik -- Transportteknik och logistik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Civil Engineering -- Transport Systems and Logistics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Annan matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Other Mathematics (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Systemvetenskap, informationssystem och informatik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Information Systems (hsv//eng)
- NATURVETENSKAP -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Probability Theory and Statistics (hsv//eng)
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Keyword
- maintenace optimization
- Stochastic programming
- mixed binary linear optimization
- stochastic opportunistic replacement problem
- Maintenance optimization
- Mixed binary linear optimization
- Stochastic opportunistic replacement problem
- Stochastic programming
Publication and Content Type
- art (subject category)
- ref (subject category)
Find in a library
To the university's database