An algorithm for single- and multiple-runway aircraft landing problem

DOI10.1016/j.matcom.2019.10.006zbMath1453.90077OpenAlexW2981466023WikidataQ126977626 ScholiaQ126977626MaRDI QIDQ2221614

Amir Salehipour

Publication date: 2 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2019.10.006

zbMATH Keywords

earliness-tardinessaircraft sequencingrunway schedulingsequence relaxation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

The aircraft runway scheduling problem: a survey ⋮ Heuristics for flights arrival scheduling at airports ⋮ The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
• An efficient hybrid meta-heuristic for aircraft landing problem
• Scatter search and bionomic algorithms for the aircraft landing problem
• Improved rolling horizon approaches to the aircraft sequencing problem
• Minimizing total completion time subject to release dates and sequence-dependent processing times
• Scheduling Aircraft Landings—The Static Case
• Algorithms for Scheduling Runway Operations Under Constrained Position Shifting

This page was built for publication: An algorithm for single- and multiple-runway aircraft landing problem