An extensive operations and maintenance planning problem with an efficient solution method
DOI10.1016/j.cor.2018.03.010zbMath1458.90220OpenAlexW2794653304WikidataQ130064706 ScholiaQ130064706MaRDI QIDQ1652643
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.03.010
mixed integer programmingcutting planesavailabilityexact solution algorithmoperations and maintenance planning
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (3)
Cites Work
- Recoverable robust single day aircraft maintenance routing problem
- Job-shop scheduling with multi-purpose machines
- Airline flight schedule planning under competition
- Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida
- An exact solution algorithm for maximizing the fleet availability of a unit of aircraft subject to flight and maintenance requirements
- The Four-Day Aircraft Maintenance Routing Problem
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Optimal joint preventive maintenance and production policies
This page was built for publication: An extensive operations and maintenance planning problem with an efficient solution method