Recoverable robust single day aircraft maintenance routing problem

DOI10.1016/J.COR.2014.03.007MaRDI QIDQ337121zbMATHOpenAlexFDO

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

zbMATH Keywords

robustnessmaintenanceairline planningrecoverability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

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

Cites work

• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• A note on the selection of Benders' cuts
• A regularized decomposition method for minimizing a sum of polyhedral functions
• A stochastic programming approach for supply chain network design under uncertainty
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Accelerating Benders decomposition by local branching
• An integrated aircraft routing, crew scheduling and flight retiming model
• An iterative approach to robust and integrated aircraft routing and crew scheduling
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Decomposition algorithms for stochastic programming on a computational grid
• Flight string models for aircraft fleeting and routing
• Integrated airline scheduling
• Large-scale mixed integer programming: Benders-type heuristics
• Modifying lines-of-flight in the planning process for improved maintenance robustness
• Multicommodity Distribution System Design by Benders Decomposition
• Network flows. Theory, algorithms, and applications.
• Partitioning procedures for solving mixed-variables programming problems
• Practical enhancements to the Magnanti-Wong method
• The aircraft maintenance routing problem
• The aircraft rotation problem
• The concept of recoverable robustness, linear programming recovery, and railway applications

Cited in

(10)

• Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model
• Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
• Modifying lines-of-flight in the planning process for improved maintenance robustness
• Operational aircraft maintenance routing problem with remaining time consideration
• Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Robust optimization: lessons learned from aircraft routing
• An extensive operations and maintenance planning problem with an efficient solution method
• The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
• 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)