Recoverable robust single day aircraft maintenance routing problem
From MaRDI portal
Publication:337121
DOI10.1016/j.cor.2014.03.007zbMath1348.90445OpenAlexW2048167415MaRDI QIDQ337121
Stephen J. Maher, François Soumis, Guy Desaulniers
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
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Case-oriented studies in operations research (90B90)
Related Items
Robust optimization: lessons learned from aircraft routing, An extensive operations and maintenance planning problem with an efficient solution method, Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem, Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty, The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model
Cites Work
- Unnamed Item
- Large-scale mixed integer programming: Benders-type heuristics
- An integrated aircraft routing, crew scheduling and flight retiming model
- Integrated airline scheduling
- Practical enhancements to the Magnanti-Wong method
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- Partitioning procedures for solving mixed-variables programming problems
- The aircraft rotation problem
- Modifying lines-of-flight in the planning process for improved maintenance robustness
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- Decomposition algorithms for stochastic programming on a computational grid
- A stochastic programming approach for supply chain network design under uncertainty
- A note on the selection of Benders' cuts
- Flight String Models for Aircraft Fleeting and Routing
- Accelerating Benders Decomposition by Local Branching
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- The Aircraft Maintenance Routing Problem
