Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem
From MaRDI portal
Publication:3985459
Recommendations
- A mixed integer linear programming formulation for multi-component deterministic opportunistic replacement
- The opportunistic replacement problem: theoretical analyses and numerical tests
- The stochastic opportunistic replacement problem. II: A two-stage solution approach
- Opportunistic replacement in a deterministic environment
- Optimizing a general optimal replacement model by fractional programming techniques
- The stochastic opportunistic replacement problem. III: Improved bounding procedures
- scientific article; zbMATH DE number 4020817
- Integral equation of optimal replacement: analysis and algorithms
- Optimal Replacement Planning by Geometric Programming
- Optimal randomized scheduling by replacement
Cites work
Cited in
(8)- Optimal Replacement Planning by Geometric Programming
- Cleaning versus replacement in power plant air preheaters: a comparison between deterministic and stochastic goal programming models
- The opportunistic replacement problem: theoretical analyses and numerical tests
- A mixed integer linear programming formulation for multi-component deterministic opportunistic replacement
- Managing a portfolio of long term service agreements
- The stochastic opportunistic replacement problem. I: Models incorporating individual component lives
- The stochastic opportunistic replacement problem. II: A two-stage solution approach
- Opportunistic replacement in a deterministic environment
This page was built for publication: Modeling Deterministic Opportunistic Replacement as an Integer Programming Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985459)