Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules

J. Keilson and L. D. Servi
Additional contact information
J. Keilson: GTE Laboratories, Incorporated, Waltham, Massachusetts, and Massachusetts Institute of Technology, Cambridge, Massachusetts
L. D. Servi: GTE Laboratories, Incorporated, Waltham, Massachusetts

Operations Research, 1989, vol. 37, issue 1, 134-140

Abstract: An M/G/1 queue with finite buffer capacity and server vacation schedules dependent on occupancy level is studied. The blocking probability is expressed simply in terms of the ergodic queue length probabilities for the infinite buffer case.

Keywords: computers: scheduling; queues: vacation models and blocking probabilities (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.1.134 (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:37:y:1989:i:1:p:134-140

Access Statistics for this article

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