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.
| Original language | English |
|---|---|
| Pages (from-to) | 192-202 |
| Number of pages | 11 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3521 |
| State | Published - 2005 |
| Event | First International Conference on Algorithmic Applications in Management, AAIM 2005 - Xian, China Duration: Jun 22 2005 → Jun 25 2005 |
Fingerprint
Dive into the research topics of 'Airplane boarding, disk scheduling and space-time geometry'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver