Airplane boarding, disk scheduling and space-time geometry

Eitan Bachma, Daniel Berend, Lubov Sapir, Steven Skiena

Research output: Contribution to journalConference articlepeer-review

8 Scopus citations


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.

Original languageEnglish
Pages (from-to)192-202
Number of pages11
JournalLecture Notes in Computer Science
StatePublished - 30 Sep 2005
EventFirst International Conference on Algorithmic Applications in Management, AAIM 2005 - Xian, China
Duration: 22 Jun 200525 Jun 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Airplane boarding, disk scheduling and space-time geometry'. Together they form a unique fingerprint.

Cite this