Reducing Waiting Time at Security Checkpoints

Edwin G. Landauer and Linda C. Becker
Additional contact information
Edwin G. Landauer: Mathematics and Engineering Department, Clackamas Community College, 19600 S. Molalla Avenue, Oregon City, Oregon 97045
Linda C. Becker: 3003 Alderbrook Court S., Puyallup, Washington 98374

Interfaces, 1989, vol. 19, issue 5, 57-65

Abstract: We were asked to improve the time it took a queue of cars to go through a security gate every morning and afternoon. Each individual passing through the gate was required to show a security badge to a guard. The goal was to improve processing time and to eliminate a safety problem at the gate without increasing the required resources. This problem required quick resolution. The project was initiated using queuing theory. After collecting data, we determined that a simulation model would be more appropriate. The study demonstrated that a significant improvement could be seen when the same number of guards worked two parallel traffic lines leading to the single gate, instead of working in a serial process from a single line of traffic.

Keywords: queues: applications; simulation: applications (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.19.5.57 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:19:y:1989:i:5:p:57-65

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().