Flight gate scheduling with respect to a reference schedule
From MaRDI portal
Publication:1761900
DOI10.1007/s10479-010-0809-8zbMath1251.90136OpenAlexW2107567322MaRDI QIDQ1761900
Erwin Pesch, Florian Jaehn, Ulrich Dorndorf
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0809-8
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (4)
Flight gate assignment and recovery strategies with stochastic arrival and departure times ⋮ Exact and heuristic approaches to the airport stand allocation problem ⋮ Fixed set search applied to the clique partitioning problem ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
Cites Work
- A survey of search methodologies and automated system development for examination timetabling
- A heuristic approach for airport gate assignments for stochastic flight delays
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models
- On the complexity of partitioning graphs into connected subgraphs
- Procedures for providing robust gate assignments for arriving aircrafts
- Recent research directions in automated timetabling
- Project scheduling with time windows. From theory to applications.
- Fast Clustering Algorithms
- New heuristics for over-constrained flight to gate assignments
- Disruption management in flight gate scheduling
This page was built for publication: Flight gate scheduling with respect to a reference schedule