Bounds on the performance of back-to-front airplane boarding policies

Eitan Bachmat; Michael Elkin

doi:10.1016/j.orl.2008.03.008

Bounds on the performance of back-to-front airplane boarding policies

Eitan Bachmat, Michael Elkin

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

Abstract

We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy which boards passengers randomly.

Original language	English
Pages (from-to)	597-601
Number of pages	5
Journal	Operations Research Letters
Volume	36
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2008.03.008
State	Published - 1 Sep 2008

Keywords

Airplane boarding
Stochastic modeling
Transportation

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2008.03.008

Cite this

@article{fded27bcf1434e7d8f7e5fe4a09f8876,

title = "Bounds on the performance of back-to-front airplane boarding policies",

abstract = "We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy which boards passengers randomly.",

keywords = "Airplane boarding, Stochastic modeling, Transportation",

author = "Eitan Bachmat and Michael Elkin",

year = "2008",

month = sep,

day = "1",

doi = "10.1016/j.orl.2008.03.008",

language = "English",

volume = "36",

pages = "597--601",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Bounds on the performance of back-to-front airplane boarding policies

AU - Bachmat, Eitan

AU - Elkin, Michael

PY - 2008/9/1

Y1 - 2008/9/1

N2 - We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy which boards passengers randomly.

AB - We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy which boards passengers randomly.

KW - Airplane boarding

KW - Stochastic modeling

KW - Transportation

UR - http://www.scopus.com/inward/record.url?scp=50249177011&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2008.03.008

DO - 10.1016/j.orl.2008.03.008

M3 - Article

AN - SCOPUS:50249177011

SN - 0167-6377

VL - 36

SP - 597

EP - 601

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Bounds on the performance of back-to-front airplane boarding policies

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this