FINITE QUEUES IN SERIES WITH EXPONENTIAL OR ERLANG SERVICE TIMES.
Abstract
This paper considers a queueing system consisting of N service channels in series where each channel has an exponential or Erlang holding time and (except for the first channel) a finite queue, and where the input process is such that the first queue is never empty. The measures considered are the steady-state mean output rate and mean number of customers in the system (excluding the first queue). First, a procedure is described for obtaining these measures which is relatively efficient computationally. Second, an exceptionally efficient procedure is developed for approximating the mean output rate for the case of exponential holding times. It is demonstrated that this procedure provides an excellent approximation for most cases and that it is computationally feasible for large problems. Third, extensive new numerical results are obtained. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 18, 1966
- Accession Number
- AD0629308
Entities
People
- Frederick Stanton Hillier
- Ronald W. Boling
Organizations
- Stanford University