A cyclic queueing network with two servers and a finite number of customers is studied. The service times for server 1 form an earma(1,1) process (exponential mixed autoregressive moving average process both of order 1) which is a sequence of positively correlated exponential random variables; the process in general is not Markovian. The service times for the other server are independent with a common exponential distribution. Limiting results for the number of customers in queue and the virtual waiting time at server 1 are obtained. Comparisons are made with the case of independent exponential service times for server 1.
No takes yet. Share an insight, caveat, or question.
A 1978 study studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: