Nonstationary Queuing Probabilities for Landing Congestion of Aircraft

Herbert P. Galliher and R. Clyde Wheeler
Additional contact information
Herbert P. Galliher: Massachusetts Institute of Technology, Cambridge, Massachusetts
R. Clyde Wheeler: Airborne Instruments Laboratory, Mineola, New York

Operations Research, 1958, vol. 6, issue 2, 264-275

Abstract: Illustration is made, with reference to a case study of airport landing congestion in the New York area, of how numerical solutions may be easily obtained for the transient behavior of nonstationary waiting lines characterized by Poisson arrivals, constant holding time, and service in order of arrival. In the case study only the mean arrival rate varies as a given function of time, but the methods used as easily provide for variation also of servicing rate and of number of servers. Exact numerical values are sought and obtained only at intervals of the servicing time. While these times were short in the case study, so that little information is sacrificed, the method may be adapted to yield more frequent values in the case of long servicing times. Subject to this restriction, the entire probability distribution of the queue is calculated as the main numerical routine, from which the distribution of waiting time is directly obtained. Use of a stored-program computer is simple, cheap, and especially effective under saturating arrival rates.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.2.264 (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:oropre:v:6:y:1958:i:2:p:264-275

Access Statistics for this article

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