An optimal data-splitting algorithm for aircraft sequencing on a single runway

DOI10.1007/s10479-021-04351-2zbMath1481.90185OpenAlexW3216115783MaRDI QIDQ2070768

Rakesh Prakash, Jitamitra Desai, Rajesh Piplani

Publication date: 24 January 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04351-2

zbMATH Keywords

schedulingaircraft sequencingconstrained position shifting0-1 mixedinteger programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Related Items

Traffic flow modeling and optimization control in the approach airspace

Cites Work

• Unnamed Item
• A dynamic programming approach for the aircraft landing problem with aircraft classes
• An efficient hybrid meta-heuristic for aircraft landing problem
• Aircraft landing problems with aircraft classes
• Scheduling models for air traffic control in terminal areas
• Improved rolling horizon approaches to the aircraft sequencing problem
• Minimizing total completion time subject to release dates and sequence-dependent processing times
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• Airport runway scheduling
• Scheduling aircraft landings using airlines' preferences
• Scheduling Aircraft Landings—The Static Case
• Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem
• Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
• State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut