Scheduling Departures at Airports — a MILP Approach | SpringerLink
Skip to main content
Springer Nature Link
Log in

Scheduling Departures at Airports — a MILP Approach

  • Conference paper
Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

  • 1301 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Abramson, J.E. Beasley, M. Krishnamoorthy, and Y.M. Sharaiha, Scheduling aircraft landings-the static case, Transportation Science 34, pp.180–197, 2000.

    Article  MATH  Google Scholar 

  2. D. Abramson, J.E. Beasley, M. Krishnamoorthy, and Y.M. Sharaiha, Displacement problem and dynamically scheduling aircraft landings, Journal of the Operational Research Society 55, pp.54–64, 2004.

    Article  MATH  Google Scholar 

  3. I. Anagnostiakis, J.-P. Clarke, Runway Operations Planning: A Two-Stage Heuristic Algorithm, Technical Report, American Institute of Aeronatics and Astronautics, MIT, 2002.

    Google Scholar 

  4. A.M. Bayen, C.J. Tomlin, Y. Ye, and J. Zhang, MILP Formulation and Polynomial Time Algorithm for an Aircraft Scheduling Problem, Proceedings of The 42nd IEEE Conference on Decision and Control (CDC), USA, 2003.

    Google Scholar 

  5. Deutsches Zentrum für Luft-und Raumfahrttechnik (DLR), Institut für Flugführung, Braunschweig, Kapazitätsstudie G9.2, 2001.

    Google Scholar 

  6. C. Hüttenmoser, F. Knabe, H. Offerman, J. Reichmuth, C. Oliva, Qualitätsbeurteilung des FAA-Gutachtens “An Investigation of the Present And Potential Future Capacity of Frankfurt am Main International Airport”, 1999.

    Google Scholar 

  7. Th. Winter, TU Braunschweig, Online and Real-Time Dispatching Problems, Dissertation, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Mathematics, Clausthal University of Technology, Erzstr. 1, 38678, Clausthal-Zellerfeld, Germany

    Florian Büchting & Petra Huhn

Authors
  1. Florian Büchting
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petra Huhn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Shipping Economics and Logistics Dept. Logistics Systems, University of Bremen, Universitätsallee GW1 Block A, 28359, Bremen, Germany

    Hans-Dietrich Haasis

  2. Faculty of Business Studies and Economics Chair of Logistics, University of Bremen, PO Box 33 04 40, 28334, Bremen, Germany

    Herbert Kopfer  & Jörn Schönberger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büchting, F., Huhn, P. (2006). Scheduling Departures at Airports — a MILP Approach. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_51

Download citation

Publish with us

Policies and ethics

Search

Navigation