Skip to main content

Airplane Boarding, Disk Scheduling and Space-Time Geometry

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3521))

Included in the following conference series:

Abstract

We show how the process of passengers boarding an airplane and the process of optimal I/O scheduling to a disk drive with a linear seek function can be asymptotically modeled by 2-dimensional space-time geometry. We relate the space-time geometry of the models to important quantities such as total boarding time and total service time. We show that the efficiency of a boarding policy depends crucially on a parameter k which depends on the interior design of the airplane. Policies which are good for small values of k are bad for large values of k and vice versa.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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. Andrews, M., Bender, M., Zhang, L.: New algorithms for the disk scheduling problem. Algorithmica 32(2), 277–301 (2002); Conference version, Proceedings of FOCS, pp. 580–589 (October 1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bull. AMS 36(4), 413–432 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bachmat, E.: Average case analysis for batched disk scheduling and increasing subsequences. In: Proceedings of STOC 2002, Montreal, Canada, pp. 277–286 (2002)

    Google Scholar 

  4. Deuschel, J.D., Zeitouni, O.: Limiting curves for iid records. Annals of Probability 23, 852–878 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feynman, R.P.: The Feynman lectures on physics, vol. II. Addison Wesley, Reading (1970)

    Google Scholar 

  6. Ferrari, P., Nagel, K.: Robustness of efficient passenger boarding in airplanes (2004) (preprint)

    Google Scholar 

  7. Gallo, G., Malucelli, F., Marre, M.: Hamiltonian paths algorithms for disk scheduling, University of Pisa technical report, 20/94 (1994)

    Google Scholar 

  8. Jacobson, D., Wilkes, J.: Disk scheduling algorithms based on rotational position, HP labs technical report, HPL-CSP-91-7rev1 (1991)

    Google Scholar 

  9. Marelli, S., Mattocks, G., Merry, R.: The role of computer simulation in reducing airplane turn time. Boeing Aero Magazine (1) (2000)

    Google Scholar 

  10. Penrose, R.: Techniques of differential yopology in relativity (1972)

    Google Scholar 

  11. van Landeghem, H., Beuselinck, A.: Reducing passenger boarding time in airplanes: A simulation approach. European J. of Operations Research 142, 294–308 (2002)

    Article  MATH  Google Scholar 

  12. Seltzer, M., Chen, P., Ousterhout, J.: Disk scheduling revisited. In: Proceedings of the Usenix technical conference, pp. 313–324 (winter 1990)

    Google Scholar 

  13. van den Briel, M., Villalobos, J., Hogg, G.: The Aircraft Boarding Problem. In: Proc. of the 12’th Industrial Eng. Res. Conf., IERC, CD ROM only, paper nr. 2153 (2003)

    Google Scholar 

  14. Visser, M., Barcelo, C., Liberati, S.: Analogue models of and for gravity. General Relativity and Gravitation 34, 1719–1734 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bachmat, E., Berend, D., Sapir, L., Skiena, S. (2005). Airplane Boarding, Disk Scheduling and Space-Time Geometry. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_22

Download citation

  • DOI: https://doi.org/10.1007/11496199_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26224-4

  • Online ISBN: 978-3-540-32440-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics