Abstract
A general throughput property of tandem queueing networks with blocking that relates existing decomposition methods to throughput bounds is discussed using the sample path approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Avi-Itzhak and M. Yadin, A sequence of two servers with no intermediate queue, Manag. Sci. 11 (1965) 553–564.
J.A. Buzacott and D. Kostelski, Matrix-geometric and recursive algorithm solution of a two-stage unreliable flow line, IIE Trans. 19 (1987) 429–438.
M.B.A. De Koster, Estimation of line efficiency by aggregation, Int. J. Prod. Res. 25 (1987) 615–626.
S.B. Gershwin, An efficient decomposition method for the approximate evaluation of tandem queues, Oper. Res. 35 (1987) 291–301.
D.K. Hildebrand, Stability of finite queue, tandem server systems, J. Appl. Prof. 4 (1967) 571–583.
F.S. Hillier and R.W. Boling, Finite queues in series with exponential or Erlang service times, a numerical approach, Oper. Res. 15 (1967) 286–303.
W.J. Hopp and J.T. Simon, Bounds and heuristics for assembly-like queues, Technical Report 87-26, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois (1987).
X-G. Liu and J.A. Buzacott, A zero-buffer equivalence technique for decomposing queueing networks with blocking, in:Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science Publ., Amsterdam, 1989) pp. 87–104.
X-G. Liu, Toward modeling assembly systems: applications of queueing networks with blocking, Ph.D. Thesis, University of Waterloo, Waterloo, Ontario (May 1990).
H. Matsuo and P.E. Slaten, A convex combination approximation for tandem queues with blocking, Technical report, The University of Texas at Austin (1988).
E.J. Muth, processes and their network representations associated with a production line queueing model, Eur. J. Oper. Res. 15 (1984) 63–83.
R.O. Onvural and H.G. Perros, On equivalences of blocking mechanisms in queueing networks with blocking, Oper. Res. Lett. 5–6 (1986) 293–298.
S.M. Ross,Stochastics Process (Wiley, New York, 1983).
J.G. Shanthikumar and M. Jufari, Bounding the performance of tandem queues with finite buffer spaces, Technical report, School of Business Administration, University of California, Berkeley (1987).
J.G. Shanthikumar and D.D. Yao, Monotonicity and concavity properties in cyclic queueing networks with finite buffers, in:Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science Publ., Amsterdam, 1989) pp. 325–344.
C. Terracol and R. David, An aggregation technique for performance evaluation of transfer lines with unreliable machines and finite buffers,Proc. IEEE Conf. on Robotics and Automation, Raleigh, NC, April 1987, pp. 1333–1337.
P. Tsoucas and J. Walrand, Monotonicity of throughput in non-Markovian networks, J. Appl. Prob. 26 (1989) 134–141.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, X.G., Buzacott, J.A. A decomposition-related throughput property of tandem queueing networks with blocking. Queueing Syst 13, 361–383 (1993). https://doi.org/10.1007/BF01149261
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01149261