Assigning arriving flights at an airport to the available gates

DOI10.1057/palgrave.jors.2600655zbMath1054.90544OpenAlexW2087305796MaRDI QIDQ3157291

Ahmet Bolat

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600655

zbMATH Keywords

heuristicsdynamic programmingbranch and boundassignmentsflight schedules

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (8)

Learning-driven feasible and infeasible tabu search for airport gate assignment ⋮ An analysis of robustness approaches for the airport baggage sorting station assignment problem ⋮ A heuristic approach for airport gate assignments for stochastic flight delays ⋮ A gate reassignment framework for real time flight delays ⋮ A new formulation and an effective matheuristic for the airport gate assignment problem ⋮ Disruption management in flight gate scheduling ⋮ The over-constrained airport gate assignment problem ⋮ Procedures for providing robust gate assignments for arriving aircrafts

This page was built for publication: Assigning arriving flights at an airport to the available gates