A dynamic programming approach for the aircraft landing problem with aircraft classes

DOI10.1016/j.ejor.2014.11.027zbMath1346.90545MaRDI QIDQ319015

Raik Stolletz, Alexander Lieder, Dirk Briskorn

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

zbMATH Keywords

scheduling; dynamic programming; aircraft landing scheduling; exact approach

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B90: Case-oriented studies in operations research

90C39: Dynamic programming

Related Items

A 3/2-Approximation for the Metric Many-Visits Path TSP, A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem, An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem, Minimizing deviation from scheduled times in a single mixed-operation runway, An optimal data-splitting algorithm for aircraft sequencing on a single runway, Methods for solving of the aircraft landing problem. I: Exact solution methods, The aircraft runway scheduling problem: a survey, Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Aircraft landing problems with aircraft classes
• Scatter search and bionomic algorithms for the aircraft landing problem
• 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
• Scheduling Aircraft Landings—The Static Case
• 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
• Scheduling aircraft landings at London Heathrow using a population heuristic
• A set packing model for the ground holding problem in congested networks