Accession Number : AD0629308

Title :   FINITE QUEUES IN SERIES WITH EXPONENTIAL OR ERLANG SERVICE TIMES.

Descriptive Note : Technical rept.,

Corporate Author : STANFORD UNIV CALIF DEPT OF STATISTICS

Personal Author(s) : Hillier,Frederick S. ; Boling,Ronald W.

Report Date : 18 MAR 1966

Pagination or Media Count : 36

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)

Descriptors :   (*QUEUEING THEORY, OPTIMIZATION), OPERATIONS RESEARCH, QUALITY CONTROL, PRODUCTION CONTROL, APPROXIMATION(MATHEMATICS), PROBABILITY

Subject Categories : Administration and Management
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE