Virtual queuing at airport security lanes
Airports continuously seek opportunities to reduce the security costs without negatively affecting passenger satisfaction. In this paper, we investigate the possibilities of implementing virtual queuing at airport security lanes, by offering some passengers a time window during which they can arrive to enter a priority queue. This process could result in a smoother distribution of arriving passengers, such that the required security personnel (costs) can be decreased. While this concept has received attention in a number of settings, such as theme parks, virtual queuing at airports bears an additional level of complexity related to the flight schedules, i.e., passengers can only be transferred forward in time to a limited extent, which we denote by the transfer time limit. We conducted a major simulation study in collaboration with a large international airport in Western Europe to determine the potential impact of virtual queuing and find that nearly one million Euro can be saved on security personnel cost without negatively impacting the passenger waiting time.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 225 (2013)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/eor|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Azmat, Carlos S. & Widmer, Marino, 2004. "A case study of single shift planning and scheduling under annualized hours: A simple three-step approach," European Journal of Operational Research, Elsevier, vol. 153(1), pages 148-175, February.
- Daniel, Joseph I, 1995. "Congestion Pricing and Capacity of Large Hub Airports: A Bottleneck Model with Stochastic Queues," Econometrica, Econometric Society, vol. 63(2), pages 327-370, March.
- Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
- Joseph D. Blackburn, 1972. "Optimal Control of a Single-Server Queue with Balking and Reneging," Management Science, INFORMS, vol. 19(3), pages 297-313, November.
- Blanc, J.P.C., 2009.
"Bad luck when joining the shortest queue,"
European Journal of Operational Research,
Elsevier, vol. 195(1), pages 167-173, May.
- Blanc, J.P.C., 2008. "Bad Luck When Joining the Shortest Queue," Discussion Paper 2008-54, Tilburg University, Center for Economic Research.
- Susan H. Xu & Long Gao & Jihong Ou, 2007. "Service Performance Analysis and Improvement for a Ticket Queue with Balking Customers," Management Science, INFORMS, vol. 53(6), pages 971-990, June.
- Cynthia Barnhart & Amy Cohn, 2004. "Airline Schedule Planning: Accomplishments and Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 6(1), pages 3-22, November.
- Nie, Winter, 2000. "Waiting: integrating social and psychological perspectives in operations management," Omega, Elsevier, vol. 28(6), pages 611-629, December. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:225:y:2013:i:1:p:153-165. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.