Procedures for providing robust gate assignments for arriving aircrafts

DOI10.1016/S0377-2217(98)00375-0zbMath0979.90084MaRDI QIDQ1579462

Ahmet Bolat

Publication date: 14 September 2000

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

zbMATH Keywords

branch and boundgate assignmentpriority functionsvariance of idle times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (16)

Flight gate assignment and recovery strategies with stochastic arrival and departure times ⋮ The construction of stable project baseline schedules ⋮ Learning-driven feasible and infeasible tabu search for airport gate assignment ⋮ Airplane boarding ⋮ Exact and heuristic approaches to the airport stand allocation problem ⋮ Breakout local search for the multi-objective gate allocation problem ⋮ An analysis of robustness approaches for the airport baggage sorting station assignment problem ⋮ A heuristic approach for airport gate assignments for stochastic flight delays ⋮ Synchronizing transportation of people with reduced mobility through airport terminals ⋮ A gate reassignment framework for real time flight delays ⋮ An integrative approach with sequential game to real-time gate assignment under CDM mechanism ⋮ An analysis of constructive algorithms for the airport baggage sorting station assignment problem ⋮ Flight gate scheduling with respect to a reference schedule ⋮ Disruption management in flight gate scheduling ⋮ The over-constrained airport gate assignment problem ⋮ Operations research/management science in the Arab world: historical development

Cites Work

• Assigning arriving flights at an airport to the available gates
• Unnamed Item

This page was built for publication: Procedures for providing robust gate assignments for arriving aircrafts