A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes

DOI10.1016/j.ejor.2018.04.021zbMath1403.90321OpenAlexW2801698893WikidataQ129971141 ScholiaQ129971141MaRDI QIDQ724035

Alain Faye

Publication date: 25 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.021

zbMATH Keywords

dynamic programmingpolynomial-time algorithmOR in airlineslanding timesaircraft landing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (1)

The aircraft runway scheduling problem: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient hybrid meta-heuristic for aircraft landing problem
• Scatter search and bionomic algorithms for the aircraft landing problem
• Scheduling models for air traffic control in terminal areas
• Dynamic scheduling of aircraft landings
• Genetic search methods in air traffic control
• Obtaining test problems via Internet
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Runway sequencing with holding patterns
• Scheduling aircraft landings using airlines' preferences
• Solving the aircraft landing problem with time discretization approach
• Scheduling Aircraft Landings—The Static Case
• Scheduling aircraft landings at London Heathrow using a population heuristic
• Displacement problem and dynamically scheduling aircraft landings

This page was built for publication: A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes