Aircraft Sequencing Problems via a Rolling Horizon Algorithm
From MaRDI portal
Publication:3167632
DOI10.1007/978-3-642-32147-4_25zbMath1370.90113OpenAlexW39795348WikidataQ57659076 ScholiaQ57659076MaRDI QIDQ3167632
Fabio Furini, Paolo Toth, Carlo Alfredo Persiani
Publication date: 2 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_25
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items
A dynamic programming approach for the aircraft landing problem with aircraft classes, Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem, The aircraft runway scheduling problem: a survey, Improved rolling horizon approaches to the aircraft sequencing problem, Heuristics for flights arrival scheduling at airports, A branch and cut heuristic for a runway scheduling problem