Scheduling aircraft landings using airlines' preferences
From MaRDI portal
Publication:2482838
DOI10.1016/j.ejor.2007.06.017zbMath1146.90424OpenAlexW2156804741MaRDI QIDQ2482838
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
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (17)
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 ⋮ Minimizing deviation from scheduled times in a single mixed-operation runway ⋮ An efficient hybrid meta-heuristic for aircraft landing problem ⋮ Airport runway scheduling ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ Aircraft landing problems with aircraft classes ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Dynamic scheduling of aircraft landings ⋮ Price of fairness in two-agent single-machine scheduling problems ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes ⋮ Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem ⋮ An optimal data-splitting algorithm for aircraft sequencing on a single runway ⋮ Methods for solving of the aircraft landing problem. I: Exact solution methods ⋮ Scheduling two agent task chains with a central selection mechanism
Cites Work
- Unnamed Item
- Runway sequencing with holding patterns
- Scheduling Aircraft Landings—The Static Case
- From Ground Holding to Free Flight: An Exact Approach
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling aircraft landings at London Heathrow using a population heuristic
- Displacement problem and dynamically scheduling aircraft landings
- Optimal Algorithms and a Remarkably Efficient Heuristic for the Ground-Holding Problem in Air Traffic Control
This page was built for publication: Scheduling aircraft landings using airlines' preferences