The Markovian Queue with Bounded Waiting time

Bezalel Gavish and Paul J. Schweitzer
Additional contact information
Bezalel Gavish: University of Rochester
Paul J. Schweitzer: IBM Thomas J. Watson Research Center, Yorktown Heights

Management Science, 1977, vol. 23, issue 12, 1349-1357

Abstract: The single-server queueing system is studied where arrivals are rejected if their waiting plus service times would exceed a fixed amount K. Applications of this model include equipment repair facilities and buffered communication devices with constant discharge rate receiving messages from a high-speed data channel. A procedure for computing the equilibrium behavior is described for the case of random arrivals and arbitrary service time requirements. Detailed analytic results and graphs are given for the case of exponentially distributed service time requirements, including the server utilization, rejection probability, mean time in system, mean server busy period, and the mean and probability density function of the virtual waiting time.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.12.1349 (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:ormnsc:v:23:y:1977:i:12:p:1349-1357

Access Statistics for this article

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