Recoverable robust single day aircraft maintenance routing problem
DOI10.1016/J.COR.2014.03.007zbMATH Open1348.90445OpenAlexW2048167415MaRDI QIDQ337121FDOQ337121
Authors: Stephen J. Maher, Guy Desaulniers, François Soumis
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10871/39937
Recommendations
- Modifying lines-of-flight in the planning process for improved maintenance robustness
- A branch-and-price approach for operational aircraft maintenance routing
- Operational aircraft maintenance routing problem with remaining time consideration
- Dynamic aircraft recovery problem -- an operational decision support framework
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Decomposition algorithms for stochastic programming on a computational grid
- A stochastic programming approach for supply chain network design under uncertainty
- Accelerating Benders decomposition by local branching
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Large-scale mixed integer programming: Benders-type heuristics
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- A note on the selection of Benders' cuts
- Multicommodity Distribution System Design by Benders Decomposition
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Integrated airline scheduling
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- The aircraft rotation problem
- Modifying lines-of-flight in the planning process for improved maintenance robustness
- Flight string models for aircraft fleeting and routing
- The aircraft maintenance routing problem
- An integrated aircraft routing, crew scheduling and flight retiming model
Cited In (10)
- Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model
- Robust optimization: lessons learned from aircraft routing
- An extensive operations and maintenance planning problem with an efficient solution method
- Operational aircraft maintenance routing problem with remaining time consideration
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Modifying lines-of-flight in the planning process for improved maintenance robustness
- A branch-and-price approach for operational aircraft maintenance routing
This page was built for publication: Recoverable robust single day aircraft maintenance routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337121)