An Extension of Erlang's Formulas Which Distinguishes Individual Servers

by Jan M. Chaiken, Edward Ignall


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback21 pages $20.00 $16.00 20% Web Discount

The mathematical proof of a result used in R-532 — concerning the areas served by two emergency units — together with related findings about certain n-unit systems. For a model in which the units cooperate in responding to calls in a region, the steady-state probability of finding a particular unit or specified combinations of units busy is found for an arbitrary service-time distribution. (See also R-531, R-532, R-533.)

This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.