Queues with Poisson Input and Hyper-Exponential Output with Finite Waiting Space

S. K. Gupta and J. K. Goyal
Additional contact information
S. K. Gupta: Department of Mathematics, Indian Institute of Technology, Kanpur (India)
J. K. Goyal: Department of Mathematics, Christ Church College, Kanpur (India)

Operations Research, 1964, vol. 12, issue 1, 75-81

Abstract: The present paper deals with the steady-state solution of the queuing system in which (i) units arrive according to a Poisson distribution; (ii) the queue discipline is first-come, first-served; and (iii) the service time distribution is hyper-exponential with n branches. Assuming a finite waiting space, we derive the system-size distribution and the mean number of units in the system therefrom. Results are also deduced when an infinite waiting space is allowed. Another interesting case is discussed when only the mean service rate over all the n branches is assigned. In the end we study the case when no queue is allowed.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.75 (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:12:y:1964:i:1:p:75-81

Access Statistics for this article

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