Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T19:45:16.385Z Has data issue: false hasContentIssue false

Bounds for the expected delays in some tandem queues

Published online by Cambridge University Press:  14 July 2016

Shun-Chen Niu*
Affiliation:
Cleveland State University
*
∗ Postal address: James J. Nance College of Business Administration, Cleveland State University, Cleveland, OH 44115, U.S.A.

Abstract

Tandem queues are analyzed. An upper bound for the stationary expected delay in front of the second server is found for a sequence of two queues in tandem where the first server has deterministic service times, the second server has general service distribution, and the arrival process is an arbitrary renewal process. The result is extended to the case of n queues in tandem where all the servers except the last one have constant service times.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1980 

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