Scheduling aircraft landings using airlines' preferences
From MaRDI portal
Publication:2482838
DOI10.1016/J.EJOR.2007.06.017zbMATH Open1146.90424OpenAlexW2156804741MaRDI QIDQ2482838FDOQ2482838
Authors: M. J. Soomer, G. J. Franx 
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.017
Recommendations
- Dynamic scheduling of aircraft landings
- Heuristic and exact algorithms for scheduling aircraft landings
- Heuristics for flights arrival scheduling at airports
- Displacement problem and dynamically scheduling aircraft landings
- Airline flight schedule planning under competition
- An airline crew scheduling for optimality
- Scheduling aircraft landings at London Heathrow using a population heuristic
- Decision support for airline schedule planning
- scientific article; zbMATH DE number 1058043
- Scheduling of time-shared jet aircraft
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling aircraft landings -- the static case
- Runway sequencing with holding patterns
- From ground holding to free flight: An exact approach
- Scheduling aircraft landings at London Heathrow using a population heuristic
- Displacement problem and dynamically scheduling aircraft landings
- Title not available (Why is that?)
- Optimal Algorithms and a Remarkably Efficient Heuristic for the Ground-Holding Problem in Air Traffic Control
Cited In (18)
- Price of fairness in two-agent single-machine scheduling problems
- A survey of due-date related single-machine with two-agent scheduling problem
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- Scheduling two agent task chains with a central selection mechanism
- Solving the aircraft landing problem with time discretization approach
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
- Aircraft landing problems with aircraft classes
- Minimizing deviation from scheduled times in a single mixed-operation runway
- Dynamic scheduling of aircraft landings
- An efficient hybrid meta-heuristic for aircraft landing problem
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- An optimal data-splitting algorithm for aircraft sequencing on a single runway
- Weighted constrained position shift model for aircraft arrival sequencing and scheduling problem
- A rescheduling and cost allocation mechanism for delayed arrivals
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Methods for solving of the aircraft landing problem. I: Exact solution methods
- Airport runway scheduling
This page was built for publication: Scheduling aircraft landings using airlines' preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482838)
