A dynamic programming approach for the aircraft landing problem with aircraft classes
DOI10.1016/J.EJOR.2014.11.027zbMATH Open1346.90545OpenAlexW2006384459MaRDI QIDQ319015FDOQ319015
Authors: A. Lieder, Dirk Briskorn, Raik Stolletz 
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.027
Recommendations
- Dynamic scheduling of aircraft landings
- An algorithm for single- and multiple-runway aircraft landing problem
- Heuristic and exact algorithms for scheduling aircraft landings
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- Solving the aircraft landing problem with time discretization approach
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)
Cites Work
- A set packing model for the ground holding problem in congested networks
- Scheduling aircraft landings -- the static case
- Minimizing total completion time subject to release dates and sequence-dependent processing times
- Airport runway scheduling
- Runway sequencing with holding patterns
- Scheduling aircraft landings using airlines' preferences
- Heuristic and exact algorithms for scheduling aircraft landings
- Algorithms for scheduling runway operations under constrained position shifting
- Aircraft sequencing problems via a rolling horizon algorithm
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- Aircraft landing problems with aircraft classes
- Title not available (Why is that?)
- Scheduling aircraft landings at London Heathrow using a population heuristic
- Scatter search and bionomic algorithms for the aircraft landing problem
Cited In (23)
- A dynamic programming approach for the airport capacity allocation problem
- Research on the optimisation of flight landing scheduling with multi-runway
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem
- Solving the aircraft landing problem with time discretization approach
- Optimization algorithm for sequencing of single-runway mixed arrival-departure aircrafts
- Methods for solving of the aircraft landing problem. II: Approximate solution methods
- Displacement problem and dynamically scheduling aircraft landings
- 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
- An optimal data-splitting algorithm for aircraft sequencing on a single runway
- Weighted constrained position shift model for aircraft arrival sequencing and scheduling problem
- An algorithm for single- and multiple-runway aircraft landing problem
- The aircraft runway scheduling problem: a survey
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- A new meta-heuristic approach for aircraft landing problem
- Methods for solving of the aircraft landing problem. I: Exact solution methods
- Algorithms for scheduling runway operations under constrained position shifting
- An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
- Airport runway scheduling
- Heuristic and exact algorithms for scheduling aircraft landings
This page was built for publication: A dynamic programming approach for the aircraft landing problem with aircraft classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319015)
