The present paper regards the queue-developing process as strongly time-dependent, often with a diurnal (24-hour) periodicity. The formation and treatment are entirely analytic and make use of machines only to solve the equations for the probabilities, by economical deterministic steps, using the coefficients as given in tabular form. Time-varying Poisson arrivals are assumed, and also an upper limit to queue length. Two laws of servicing are used: Poisson and fixed service time; these extremes are found to lead to numerically close results in the realistic case. This situation contrasts with the much cruder approximation of deterministic flow models. The stochastic equations belong to well studied types of differential or difference equations. When the coefficients have a 24-hour period, so does just one solution, all others approaching it. Actual airport statistics are made the basis of certain revealing computations. A perturbation method for treating multiple queues is outlined. The concrete results are exhibited as graphs.

  • Authors:
    • Koopman, B O
  • Publication Date: 1972-11

Media Info

  • Pagination: 25 p.
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00155493
  • Record Type: Publication
  • Source Agency: Massachusetts Institute of Technology
  • Files: TRIS
  • Created Date: Aug 31 1977 12:00AM