The stochastic opportunistic replacement problem. III: Improved bounding procedures

DOI10.1007/S10479-019-03278-ZzbMath1451.90102OpenAlexW2948613010WikidataQ127746662 ScholiaQ127746662MaRDI QIDQ827144

Efraim Laksman, Michael Patriksson, Ann-Brith Strömberg

Publication date: 6 January 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03278-z

zbMATH Keywords

stochastic programmingmaintenance optimizationmixed binary linear optimizationstochastic opportunistic replacement problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Genetic algorithms for condition-based maintenance optimization under uncertainty
• A stochastic model for joint spare parts inventory and planned maintenance optimisation
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Partitioning procedures for solving mixed-variables programming problems
• The opportunistic replacement problem: theoretical analyses and numerical tests
• Introduction to Stochastic Programming

This page was built for publication: The stochastic opportunistic replacement problem. III: Improved bounding procedures