Queuing with Multiple Poisson Inputs and Exponential Service Times

C. J. Ancker and A. V. Gafarian
Additional contact information
C. J. Ancker: System Development Corporation, Santa Monica, California
A. V. Gafarian: System Development Corporation, Santa Monica, California

Operations Research, 1961, vol. 9, issue 3, 321-327

Abstract: This paper contains an analysis of a single-server queuing system for m different types of customers having independent Poisson arrivals with rates (lambda) ı , ı = 1, ..., m and exponential service times with rates (mu) ı , ı = 1, ..., m . The discipline is first-come, first-served. Some derived results are (a) a recursion relation for the steady-state probability of n in queue, (b) a recursion relation for the steady-state probability that some member of a particular class is in service and that n of any class are in queue, and (c) the characteristic equation for the waiting-time distribution and its general inversion for the two-population case. The recursion relations are simple for computational purposes.

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.3.321 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:9:y:1961:i:3:p:321-327

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().