Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-27T08:10:45.608Z Has data issue: false hasContentIssue false
  • English
  • Français

EFFECTIVE UPPER BOUNDS FOR EXPECTED CYCLE TIMES IN TANDEM QUEUES WITH COMMUNICATION BLOCKING

Published online by Cambridge University Press:  27 July 2001

Koichi Nakade
Koichi Nakade
Affiliation:
Department of Systems Engineering, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya 466-8555, Japan, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Tandem queues with finite buffers have been widely discussed as basic models of communication and manufacturing systems. The cycle time is the important measure in such systems. In this article, we consider finite tandem queues with communication blocking and general service-time distributions. We introduce an order on pairs of random variable sets to give effective upper bounds for the expected cycle times.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 3 , July 2001 , pp. 327 - 334
Copyright
© 2001 Cambridge University Press

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.)