Meta-heuristics for aircraft arrival and departure scheduling on multiple runways

Ghaith Rabadi, Gulsah Hancerliogullari, Mohamed Kharbeche, Ameer Al-Salem

Research output: Contribution to conferencePaperpeer-review

2 Citations (Scopus)


The problem of scheduling aircrafts on multiple runways can be modeled as an identical parallel machine scheduling with release times, target times and deadlines. To schedule arriving and departing aircrafts as close as possible to their target times, the total weighted tardiness is minimized. Furthermore, sequence-dependent separation times on each runway must be considered to avoid wake-vortex effects. These separation times make the problem significantly more difficult especially that they do not necessarily follow the triangular inequality. In this research, we present a priority rule and a Simulated Annealing algorithm to find good schedules in reasonable computational times. The performance of the algorithms is evaluated by solving small and medium problems and comparing them to optimal solutions.

Original languageEnglish
Number of pages8
Publication statusPublished - 2012
Externally publishedYes
Event62nd IIE Annual Conference and Expo 2012 - Orlando, FL, United States
Duration: 19 May 201223 May 2012


Conference62nd IIE Annual Conference and Expo 2012
Country/TerritoryUnited States
CityOrlando, FL


  • Aircraft sequencing problem
  • Heuristics
  • Multiple runways
  • Parallel machine scheduling
  • Total tardiness


Dive into the research topics of 'Meta-heuristics for aircraft arrival and departure scheduling on multiple runways'. Together they form a unique fingerprint.

Cite this