I. Adiri
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.
- 1 COFFMAN, E. C., AND KRISHNAMOORTHY, B. Preliminary analyses of time-shared computer operation. SP-1719, System Development Corp., Santa Monica, Ctdif., Aug. 1964.Google Scholar
- 2 KJHISHNAMOOWrHI, B., AND WOOD, R.G. Time-sttared operations with both interarrivAl and service time exponential, J. ACM 18, 3 (July 1966), 317-338. Google Scholar
- 3 ADIHII, I., ANI) AVHTZlIAK, B. A time-sharing queue. Oper. Res. Stat. add Econ. Mimeo. Ser. No. 5, Dept, of Ind. add Mgt. Eng., Teehnion, Haifa, Israel.Google Scholar
- 4 KNTCI-iNE, A. YA. On mean time of stoppage of machines. Mat. Sb. 40 (1933), 119-123. (In Russian)Google Scholar
- 5 KRONIG, R. On time Losses in machinery undergoing interruption, I. Physica 10 (1943), 215-22-i.Google Scholar
- 6 KRONIG, R., AND MONDaI,, H. Oil. time losses in machinery undergoing interruption, II. Physica I0 (1943), 331-333.Google Scholar
- 7 TaKCS, L. On a stochastic process concerning some waiting time problems. Theory of Probability and its Applications Ii, 1 (1957), 9{)--103.Google Scholar
- 8 KRISHNAMOOITHI, B. The stationary behaviour of a time-sharing system under Poisson assumptions. OPSEARCH-J. Oper. Res. Soc. India 3, 3 (1966), 101-117.Google Scholar
Index Terms
- A Time-Sharing Queue with a Finite Number of Customers
Recommendations
Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit
The present paper deals with a generalization of the homogeneous multi-server finite-source retrial queue with search for customers in the orbit. The novelty of the investigation is the introduction of balking and impatience for requests who arrive at ...
Single server retrial queue with group admission of customers
We consider a retrial queueing system with a single server and novel customer s admission discipline. The input flow is described by a Markov Arrival Process. If an arriving customer meets the server providing the service, it goes to the orbit and ...
An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers
We consider a multi-priority, N-server, Poisson arrival, nonpreemptive queue, motivated by police applications. The number of servers requested by an arrival has a known priority dependent probability distribution. All servers requested by a customer ...
Comments