The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints

DOI10.1016/j.ejor.2017.06.041zbMath1375.90050OpenAlexW2651771600MaRDI QIDQ1681502

Guy Desaulniers, François Soumis, Stephen J. Maher

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/86932/1/The_daily_tail_assignment_problem.pdf

zbMATH Keywords

iterative algorithmtransportationbranch-and-pricemaintenance planningtail assignment

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)

Related Items (2)

Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem ⋮ Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model

Uses Software

• SCIP

Cites Work

• Recoverable robust single day aircraft maintenance routing problem
• 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
• Operational aircraft maintenance routing problem with remaining time consideration
• The Four-Day Aircraft Maintenance Routing Problem
• Flight String Models for Aircraft Fleeting and Routing
• The Aircraft Maintenance Routing Problem

This page was built for publication: The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints