Stochastic Runway Scheduling

Senay Solak (), Gustaf Solveling (), John-Paul B. Clarke () and Ellis L. Johnson ()
Additional contact information
Senay Solak: Isenberg School of Management, University of Massachusetts, Amherst, Massachusetts 01003
Gustaf Solveling: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
John-Paul B. Clarke: School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Ellis L. Johnson: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332

Transportation Science, 2018, vol. 52, issue 4, 917-940

Abstract: Runway scheduling deals with the sequencing of arriving and departing aircraft at airports such that a predefined objective is optimized subject to several operational constraints. Different from the existing deterministic approaches in the literature, we consider a new approach to the stochastic version of this problem within the general context of machine scheduling problems. As part of our analysis, we first show that a restricted version of the stochastic runway-scheduling problem is equivalent to a machine-scheduling problem on a single machine with sequence-dependent setup times and stochastic due dates. We then extend this restricted model by considering characteristics specific to the runway-scheduling problem and present two different stochastic integer programming models. We derive some tight valid inequalities for these formulations and propose a solution methodology based on sample average approximation and Lagrangian-based scenario decomposition. Realistic data sets are then used to perform a detailed computational study involving implementations and analyses of several different configurations of the models. The results from the computational tests indicate that truncated versions of the proposed solution algorithm, where the best solution is reported after short run times, almost always produce very high-quality solutions, implying that the proposed stochastic approach to runway scheduling is likely to be practically implementable with potential value over current practice or deterministic models.

Keywords: runway scheduling; stochastic programming; job scheduling; stochastic due dates; Lagrangian decomposition (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1287/trsc.2017.0784 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:52:y:2018:i:4:p:917-940

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().