A Time-Sharing Queue with a Finite Number of Customers

18Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations. © 1969, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Adiri, I., & Avi-Itzhak, B. (1969). A Time-Sharing Queue with a Finite Number of Customers. Journal of the ACM (JACM), 16(2), 315–323. https://doi.org/10.1145/321510.321523

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free