Runway sequencing with holding patterns

DOI10.1016/j.ejor.2006.06.076zbMath1146.90402OpenAlexW1987688464MaRDI QIDQ2482798

Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr

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.2006.06.076

zbMATH Keywords

schedulingmixed integer programmingair-traffic control

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items

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 ⋮ Arc-B-consistency of the inter-distance constraint ⋮ The aircraft runway scheduling problem: a survey ⋮ Dynamic scheduling of aircraft landings ⋮ Data and queueing analysis of a Japanese air-traffic flow ⋮ Scheduling aircraft landings using airlines' preferences ⋮ A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes

Cites Work

• Unnamed Item
• Scheduling jobs with fixed start and end times
• On the complexity of scheduling tasks with discrete starting times
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• On the approximability of an interval scheduling problem
• Graph coloring for air traffic flow management
• Scheduling jobs of equal length: Complexity, facets and computational results
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Approximation Algorithms for Fixed Job Schedule Problems
• Interval selection: Applications, algorithms, and lower bounds
• Principles and Practice of Constraint Programming – CP 2004