Pruning Rules for Optimal Runway Sequencing

References

• Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219–239.Crossref, Google Scholar
• Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3):985–1032.Crossref, Google Scholar
• Atkin JAD (2008) Online decision support for take-off runway scheduling at London Heathrow airport. Unpublished doctoral thesis, School of Computer Science, University of Nottingham, Nottingham, UK.Google Scholar
• Atkin JAD (2013) Airport airside optimisation problems. Etaner-Uyar AS, Ozcan E, Urquhard N, eds. Automated Scheduling and Planning, From Theory to Practice, Studies Comput. Intelligence, Vol. 505 (Springer-Verlag, Berlin Heidelberg), 1–37.Crossref, Google Scholar
• Atkin JAD, Burke EK, Greenwood JS (2010) TSAT allocation at London Heathrow: The relationship between slot compliance, throughput and equity. Public Transport 2:173–198.Crossref, Google Scholar
• Atkin JAD, Burke EK, Greenwood JS, Reeson D (2007) Hybrid metaheuristics to aid runway scheduling at London Heathrow airport. Transportation Sci. 41(1):90–106.Link, Google Scholar
• Atkin JAD, De Maere G, Burke EK, Greenwood JS (2012) Addressing the pushback time allocation problem at Heathrow airport. Transportation Sci. 47(4):584–602.Link, Google Scholar
• Balakrishnan H, Chandran B (2010) Algorithms for scheduling runway operations under constrained position shifting. Oper. Res. 58(6):1650–1665.Link, 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
• Bianco L, Dell’Olmo P, Giordani S (1999) Minimizing total completion time subject to release dates and sequence-dependent processing times. Ann. Oper. Res. 86:393–415.Crossref, Google Scholar
• Dear RG (1976) The dynamic scheduling of aircraft in the near terminal area. Technical report, Flight Transportation Laboratory, Massachusetts Institute of Technology, CambridgeGoogle Scholar
• Ernst AT, Krishnamoorthy M, Storer RH (1999) Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3): 229–241.Crossref, Google Scholar
• Eurocontrol (2013) Challenges of growth 2013. Technical report, Eurocontrol, Brussels. http://www.eurocontrol.int/sites/default/files/content/documents/official-documents/reports/201307-challenges-of-growth-summary-report.pdf.Google Scholar
• Furini F, Persiani C, Toth P (2012) Aircraft sequencing problems via a rolling horizon algorithm. Mahjoub A, Markakis V, Milis I, Paschos V, eds. Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 7422 (Springer-Verlag, Berlin Heidelberg), 273–284.Crossref, Google Scholar
• Luo X, Chu C (2007) A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. Eur. J. Oper. Res. 180(1):68–81.Crossref, Google Scholar
• Luo X, Chu F (2006) A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Appl. Math. Comput. 183(1):575–588.Crossref, Google Scholar
• Luo X, Liu X, Wang C, Liu Z (2005) Dominance rules for single machine schedule with sequence dependent setup and due date. J. Control Theory Appl. 3(4):364–370.Crossref, Google Scholar
• Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper. Res. 25(1):45–61.Link, Google Scholar
• Pinedo M (2002) Scheduling: Theory, Algorithms and Systems, 2nd ed. (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Psaraftis HN (1980) A dynamic programming approach for sequencing groups of identical jobs. Oper. Res. 28(6):1347–1359.Link, Google Scholar
• Ragatz GL (1993) A branch and bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. Proc. 24th Annual Meeting Decision Sci. Institute, 1375–1377.Google Scholar
• Sewell EC, Sauppe JJ, Morrison DR, Jacobson SH, Kao GK (2012) A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Global Optim. 54(4):791–812.Crossref, Google Scholar
• Sourd F (2005) Earliness—Tardiness scheduling with setup considerations. Comput. Oper. Res. 32(7):1849–1865.Crossref, Google Scholar