State-Dependent System Residence times for time Shared Queues

Stephen R. Kimbleton
Additional contact information
Stephen R. Kimbleton: University of Michigan

Management Science, 1971, vol. 18, issue 1, 1-6

Abstract: In this paper we obtain the Laplace-Stieltjes transform of the time an arriving customer spends in an FB N queueing system until completion of service at the kth level (1 \leqq k \leqq N) given that at least k levels of service are required. The results are conditioned upon the state of the system at the time of arrival of the customer.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.1.1 (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:18:y:1971:i:1:p:1-6

Access Statistics for this article

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