The opportunistic replacement problem: theoretical analyses and numerical tests

DOI10.1007/s00186-012-0400-yzbMath1258.49047OpenAlexW1999762558MaRDI QIDQ1935953

Magnus Önnheim, Ann-Brith Strömberg, Niclas Andréasson, Torgny Almgren, Adam Wojciechowski, Michael Patriksson

Publication date: 20 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00186-012-0400-y

zbMATH Keywords

mixed integer programmingcomplexity analysismaintenance optimizationpolyhedral analysis

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear systems in control theory (93C05)

Related Items

The stochastic opportunistic replacement problem. III: Improved bounding procedures

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Opportunistic replacement in a deterministic environment
• An optimal replacement policy for life limited parts
• A mixed integer linear programming formulation for multi-component deterministic opportunistic replacement
• A review of multi-component maintenance models with economic dependence
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• The stochastic opportunistic replacement problem. I: Models incorporating individual component lives
• The stochastic opportunistic replacement problem. II: A two-stage solution approach
• A replacement schedule for multicomponent life-limited parts
• Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem