Time-Indexed Formulations for the Runway Scheduling Problem

References

• Abela J, Abramson D, Krishnamoorthy M, De Silva A, Mills G (1993) Computing optimal schedules for landing aircraft. Proc. 12th National Conf. Australian Soc. Oper. Res., Adelaide, Australia, 71–90.Google Scholar
• Ascheuer N, Fischetti M, Grötschel M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Programming 90(3):475–506.Crossref, Google Scholar
• Atkin JAD, Burke E, Greenwood J, Reeson D (2007) Hybrid metaheuristics to aid runway scheduling at London Heathrow airport. Transportation Sci. 41(1):90–106.Link, Google Scholar
• Balakrishnan H, Chandran BG (2010) Algorithms for scheduling runway operations under constrained position shifting. Oper. Res. 58(6):1650–1665.Link, Google Scholar
• Beasley JE, Sonander J, Havelock P (2001) Scheduling aircraft landings at London Heathrow using a population heuristic. J. Oper. Res. Soc. 52(5):483–493.Crossref, Google Scholar
• Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2000) Scheduling aircraft landings–the static case. Transportation Sci. 34(2):180–197.Link, Google Scholar
• Bennell JA, Mesgarpour M, Potts CN (2011) Airport runway scheduling. 4OR 9(2):115–138.Crossref, Google Scholar
• Briskorn D, Stolletz R (2014) Aircraft landing problems with aircraft classes. J. Scheduling 17(1):31–45.Crossref, Google Scholar
• De Maere G, Atkin JAD (2015) Pruning rules for optimal runway sequencing with airline preferences. Lecture Notes Management Sci. 7:76–82.Google Scholar
• Furini F, Persiani CA, Toth P (2012) Aircraft sequencing problems via a rolling horizon algorithm. Mahjoub AR, Markakis V, Mills I, Paschos VT, eds. Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 7422 (Springer, Berlin Heidelberg), 273–284.Crossref, Google Scholar
• Furini F, Kidd MP, Persiani CA, Toth P (2014) State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting. Fouilhoux P, Gouveia L, Mahjoub AR, Paschos V, eds. Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 8596 (Springer International Publishing, Cham, Switzerland), 267–279.Crossref, Google Scholar
• Furini F, Kidd MP, Persiani CA, Toth P (2015) Improved rolling horizon approaches to the aircraft sequencing problem. J. Scheduling 18(5):435–447.Crossref, Google Scholar
• Graupl T, Jandl B, Rokitansky CH (2012) Simple and efficient integration of aeronautical support tools for human-in-the-loop evaluations. Integrated Comm., Navigation Surveillance Conf. (ICNS), Herndon, VA, F4-1–F4-9.Crossref, Google Scholar
• Harrod S (2011) Modeling network transition constraints with hypergraphs. Transportation Sci. 45(1):81–97.Link, Google Scholar
• Heidt A (2014) Robust runway scheduling using a time-indexed model. Schaefer D, ed. Proc. Fourth SESAR Innovation Days EUROCONTROL.Google Scholar
• Kjenstad D, Mannino C, Schittekat P, Smedsrud M (2013b) Integrated surface and departure management at airports by optimization. 2013 5th Internat. Conf. Modeling, Simulation Appl. Optim. (ICMSAO), Hammamet, Tunisia, 1–5.Crossref, Google Scholar
• Kjenstad D, Mannino C, Schittekat P, Nordlander T, Smedsrud M (2013a) Optimizing AMAN-SMAN-DMAN at Hamburg and Arlanda airport. Schaefer D, ed. Proc. Third SESAR Innovation Days EUROCONTROL, https://www.sesarju.eu/sites/default/files/documents/sid/2013/SID-2013-13.pdf.Google Scholar
• Kopf R, Ruhe G (1987) A computational study of the weighted independent set problem for general graphs. Foundations Control Engrg. 12(4):167–180.Google Scholar
• Lieder A, Briskorn D, Stolletz R (2015) A dynamic programming approach for the aircraft landing problem with aircraft classes. Eur. J. Oper. Res. 243(1):61–69.Crossref, Google Scholar
• Masin M, Raviv T (2014) Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem. J. Scheduling 17(4):321–338.Crossref, Google Scholar
• Nogueira TH, de Carvalho CRV, Ravetti MG (2014) Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates. Optim. Online, http://www.optimization-online.org/DB_HTML/2014/07/4442.html.Google Scholar
• Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. Fachbereich Mathematik: Preprint-Reihe Mathematik, TU, Fachbereich 3, Berlin.Google Scholar
• Samà M, D’Ariano A, Pacciarelli D (2013) Rolling horizon approach for aircraft scheduling in the terminal control area of busy airports. Transportation Res. Part E: Logist. Transportation Rev. 60:140–155.Crossref, Google Scholar
• Savelsbergh MWP, Uma RN, Wein J (2005) An experimental study of LP-based approximation algorithms for scheduling problems. INFORMS J. Comput. 17(1):123–136.Link, Google Scholar
• SESAR, Joint Undertaking (2007) High performing aviation for Europe, http://www.sesarju.eu/.Google Scholar
• Sousa JP, Wolsey LA (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math. Programming 54(1–3):353–367.Crossref, Google Scholar
• Uma RN, Wein J (1998) On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems. Bixby RE, Boyd EA, Rios-Mercado RZ, eds. Integer Programming and Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 1412 (Springer, Berlin Heidelberg), 394–408.Crossref, Google Scholar
• Van den Akker JM, Hurkens CAJ, Savelsbergh MWP (2000) Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J. Comput. 12(2):111–124.Link, Google Scholar
• Waterer H, Johnson EL, Nobili P, Savelsbergh MWP (2002) The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Programming 93(3):477–494.Crossref, Google Scholar
• Wolsey LA (1998) Integer Programming (Wiley, New York).Google Scholar
• Wolsey LA, Nemhauser GL (2014) Integer and Combinatorial Optimization (John Wiley & Sons, New York).Google Scholar