Polynomial-time feasibility condition for multiclass aircraft sequencing on a single-runway airport

IEEE Transactions on Intelligent Transportation Systems

Volumn 12, Issue 1, 2011, Pages 2-14

  Harikiopoulo, Dimitri ^a   Neogi, Natasha ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Aircraft landing problem; polynomial time algorithm; state dependent scheduling

Indexed keywords

AIRCRAFT SEQUENCING; FEASIBILITY CONDITION; FEDERAL AVIATION ADMINISTRATION; LANDING PROBLEMS; MAKESPAN; MULTI-CLASS; NP COMPLETE; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHM; RELATIVE WEIGHTS; SCHEDULING PROBLEM; SINGLE-RUNWAY AIRPORT; STATE-DEPENDENT; STATE-DEPENDENT SCHEDULING; TIME INTERVAL;

AIR TRAFFIC CONTROL; AIRCRAFT; AIRCRAFT LANDING; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SCHEDULING ALGORITHMS;

AIRCRAFT CONTROL;

EID: 79952071629     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2010.2055856     Document Type: Article

References (23)

1. Fed. Aviation Admin., Delays and scheduled flights at O' Hare, 2004. [Online]. Available: http://www.faa.gov/newsroom/O'HareData.ppt
2. H. N. Psaraftis, "A dynamic programming approach for sequencing groups of identical jobs," Oper. Res., vol. 28, no. 6, pp. 1347-1359, 1980.
3. Fed. Aviation Admin., Chicago TRACON. [Online]. Available: http://www.faa.gov/ats/c90/
4. L. Bianco, P. Dell'Olmo, and S. Giordani, "Scheduling models and algorithms for TMA traffic management," in Modelling and Simulation for Air Traffic Management, L. Bianco and P. Dell'Olmo, Eds. Berlin, Germany: Springer-Verlag, 1997, pp. 139-167.
5. R. De Neufville and A. Odoni, Airport Systems: Planning, Design, and Management. New York: McGraw-Hill, 2002.
6. R. G. Dear, "The dynamic scheduling of aircraft in the near terminal area," Flight Transp. Lab., Cambridge, MA, FTL Rep. R76-9, 1976.
7. R. G. Dear and Y. S. Sherif, "An algorithm for computer assisted sequencing and scheduling of terminal area operations," Transp. Res. A, Policy Pract., vol. 25, no. 2/3, pp. 129-139, Mar.-May 1991.
8. H. N. Psaraftis, "A dynamic programming approach to the aircraft sequencing problem," Flight Transp. Lab., Cambridge, MA, FTL Rep. R78-4, 1978.
9. C. S. Venkatakrishan, A. Barnett, and A. R. Odoni, "Landings at logan airport: Describing and increasing airport capacity," Transp. Sci., vol. 27, no. 3, pp. 211-217, Aug. 1993.
10. A. Bayen, J. Zhang, C. Tomlin, and Y. Ye, "MILP formulation and polynomial time algorithm for an aircraft scheduling problem," in Proc. IEEE Conf. Decision Control, 2003, pp. 5003-5010.
11. A. Bayen, J. Zhang, C. Tomlin, and Y. Ye, "An approximation for scheduling aircraft with holding times," ESA, Paris, France, 2003.
12. J. E. Beasley, M. Krishnamoorty, Y. M. Sharaiha, and D. Abramson, "Scheduling aircraft landings-The static case," Transp. Sci., vol. 34, no. 2, pp. 180-197, May 2000.
13. L. Bianco, S. Ricciardelli, G. Rinaldi, and A. Sassano, "Scheduling tasks with sequence-dependent processing times," Naval Res. Logist., vol. 35, no. 2, pp. 177-184, 1988.
14. L. Bianco, P. Dell'Olmo, and S. Giordani, "Minimizing total completion time subject to release dates and sequence dependent processing times," Ann. Oper. Res., vol. 86, pp. 393-415, Jan. 1999.
15. L. Bianco, P. Dell'Olmo, and S. Giordani, "Coordination of traffic flows in the TMA," in New Concepts and Methods in Air Traffic Management, L. Bianco, P. Dell'Olmo, and A. R. Odoni, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 95-124.
16. I. Anagnostakis and J. P. Clarke, "Runway operations planning and control sequencing and scheduling," AIAA J. Aircr., vol. 38, pp. 988-996, 2002.
17. I. Anagnostakis and J. P. Clarke, "Runway operations planning: A twostage solution methodology," in Proc. 36th Annu. Hawaii Int. Conf. Syst. Sci., Jan. 2003, p. 79.1.
18. J. Milan, "The flow management problem in air traffic control: A model of assigning priorities at a congested airport," Transp. Plan. Technol., vol. 20, no. 2, pp. 131-162, Feb. 1997.
19. C. Wu and R. E. Caves, "Research review of air traffic management," Transp. Rev., vol. 22, no. 1, pp. 115-132, Jan. 2002. (Pubitemid 34057515)
20. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
21. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan, "Optimization and approximation in deterministic sequencing theory: A survey," Ann. Discr. Math., vol. 5, pp. 287-326, 1979.
22. A. H. G. Rinnooy Kan, Machine Scheduling Problems. Hague, The Netherlands: Martinus Nijhoff, 1976.
23. C.-S. Shih and J. W. S. Liu, "State-dependent deadline scheduling," in Proc. 23rd IEEE RTSS, 2002, pp. 3-14.