Airplane boarding, disk scheduling and space-time geometry

Authors:
Eitan Bachmat;Daniel Berend;Luba Sapir;Steven Skiena
Affiliations:
Department of Computer Science, Ben-Gurion University;Departments of Mathematics and Computer Science, Ben-Gurion University;Department of Industrial Engineering and Management, Ben-Gurion University;Department of Computer Science, SUNY at Stony Brook
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 2
Cited 2

Average case analysis for batched disk scheduling and increasing subsequences

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
New algorithms for the disk scheduling problem

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

America West Airlines Develops Efficient Boarding Strategies

Interfaces
Analysis of Airplane Boarding Times

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.