Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T06:54:56.124Z Has data issue: false hasContentIssue false

On the ordering of tandem queues with exponential servers

Published online by Cambridge University Press:  14 July 2016

Tapani Lehtonen*
Affiliation:
Helsinki School of Economics
*
∗ Postal address: Helsinki School of Economics, Runebergink. 22–24, 00100 Helsinki 10, Finland.

Abstract

We consider tandem queues which have a general arrival process. The queueing system consists of s (s ≧ 2) single-server service stations and the servers have exponential service-time distributions. Firstly we give a new proof for the fact that the departure process does not depend on the particular allocation of the servers to the stations. Secondly, considering the service rates, we prove that the departure process becomes stochastically faster as the homogeneity of the servers increases in the sense of a given condition. It turns out that, given the sum of the service rates, the departure process is stochastically fastest in the case where the servers are homogeneous.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable