An Extension of Erlang's Formulas Which Distinguishes Individual Servers

Jan M. Chaiken, Edward Ignall

ResearchPublished 1971

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.)

Topics

Document Details

Citation

Chicago Manual of Style

Chaiken, Jan M. and Edward Ignall, An Extension of Erlang's Formulas Which Distinguishes Individual Servers. Santa Monica, CA: RAND Corporation, 1971. https://www.rand.org/pubs/reports/R0567.html.
BibTeX RIS

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

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND 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.