Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-06-01T17:15:35.982Z Has data issue: false hasContentIssue false
  • English
  • Français

Servers in tandem with k-stage blocking and communications-type flow

Part of: Operations research and management science Special processes

Published online by Cambridge University Press:  14 July 2016

Benjamin Avi-Itzhak
Benjamin Avi-Itzhak*
Affiliation:
RUTCOR
*
∗Postal address: RUTCOR, Rutgers Center for Operations Research, Rutgers University, Busch Campus, New Brunswick, NJ 08903, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Modeling of manufacturing lines and data communications makes frequent use of tandem queues with blocking. Here we present and study such a system with a k-stage blocking scheme in which processing in each station requires attendance of the server of that station together with the servers of the next k – 1 stations. This scheme describes the conventional manufacturing and communications blocking schemes but is also representative of a wider range of applications. Explicit expressions for residence times, throughput, queueing times, waiting times and other measures of performance are obtained for the case of communications type flow and just-in-time input. Use of the results in modeling and analyzing a highway traffic flow situation is presented.

Keywords

TANDEM QUEUESMANUFACTURING BLOCKINGCOMMUNICATIONS BLOCKINGROAD TRAFFIC

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) 90B20: Traffic problems
Type
Research Article
Information
Journal of Applied Probability , Volume 31 , Issue 4 , December 1994 , pp. 1061 - 1069
Copyright
Copyright © Applied Probability Trust 1994 

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

References

Avi-Itzhak, B. and Halfin, S. (1993) Servers in tandem with communication and manufacturing blocking. J. Appl. Prob. 30, 429–437.CrossRefGoogle Scholar
Avi-Itzhak, B. and Levy, H. (1993) A sequence of servers with arbitrary input and regular service times revisited. RUTCOR Research Report RRR 5–93, Rutgers University.Google Scholar
Avi-Itzhak, B. and Yadin, M. (1965) A sequence of two servers with no intermediate queue. Management Sci. 11, 553–564.CrossRefGoogle Scholar
Caseau, P. and Pujolle, G. (1979) Throughput capacity of a sequence of transfer lines with blocking due to finite waiting room. IEEE Trans. Softw. Eng. 5, 631–642.Google Scholar
Kelly, F. P. (1982) The throughput of a service of buffers. Adv. Appl. Prob. 14, 633–653.CrossRefGoogle Scholar
Massey, W. A. (1993) Balanced queues in series with communication blocking. Math. Operat. Res. To appear.Google Scholar
Muth, E. J. (1973) The production rate of a series of work stations with variable service times. Internat. J. Production Res. 11, 155–169.CrossRefGoogle Scholar
Onvural, R. O. (1990) Survey of closed queueing networks with blocking. ACM Comp. Surveys 22, 83–121.CrossRefGoogle Scholar
Perros, H. G. and Altiok, T. (1984) Queueing networks with blocking: a bibliography. Performance Evaluation Review. ACM Sigmetrics 12, 8–12.Google Scholar