Runway sequencing with holding patterns
From MaRDI portal
Publication:2482798
Recommendations
Cites work
- Approximation Algorithms for Fixed Job Schedule Problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Graph coloring for air traffic flow management
- Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
- Interval selection: Applications, algorithms, and lower bounds
- On the approximability of an interval scheduling problem
- On the complexity of scheduling tasks with discrete starting times
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling jobs of equal length: Complexity, facets and computational results
- Scheduling jobs with fixed start and end times
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
Cited in
(18)- Minimizing deviation from scheduled times in a single mixed-operation runway
- Dynamic scheduling of aircraft landings
- Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
- Data and queueing analysis of a Japanese air-traffic flow
- Airport runway scheduling
- Scheduling aircraft landings using airlines' preferences
- Solving the aircraft landing problem with time discretization approach
- The aircraft runway scheduling problem: a survey
- Aircraft sequencing problems via a rolling horizon algorithm
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
- An efficient hybrid meta-heuristic for aircraft landing problem
- Scheduling departures at airports -- a MILP approach
- scientific article; zbMATH DE number 1149870 (Why is no real title available?)
- A branch and cut heuristic for a runway scheduling problem
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- Arc-B-consistency of the inter-distance constraint
- Improved rolling horizon approaches to the aircraft sequencing problem
This page was built for publication: Runway sequencing with holding patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482798)