State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting

DOI10.1007/978-3-319-09174-7_23zbMath1445.90032OpenAlexW340657684WikidataQ57659061 ScholiaQ57659061MaRDI QIDQ3195337

Carlo Alfredo Persiani, Paolo Toth, Fabio Furini, Martin Philip Kidd

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_23

zbMATH Keywords

integer programmingdynamic programmingaircraft sequencing problemconstrained position shiftingcompletion bounds

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Improved rolling horizon approaches to the aircraft sequencing problem, A branch and cut heuristic for a runway scheduling problem, An optimal data-splitting algorithm for aircraft sequencing on a single runway, Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach