Some Properties of Throughput in a Queueing Network with Changing-Speed Servers and Blocking

  • Genji Yamazaki
  • Hirotaka Sakasegawa
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 19)


A class of queueing networks, called the Jackson networks, is well known to have a convenient property for queue length distributions, namely, the so-called product form (see, e.g.,Walrand [5]). This property enables us to calculate the queue length distributions for large-scale queueing networks, and hence Jackson networks have been used extensively in the design or performance evaluation of communication systems. On the other hand, these queueing networks have not been used so often for manufacturing systems. Of course, there are exceptions, e.g., an attempt has been made to apply the networks to flexible manufacturing systems (FMSs; for details, see [1]). Why haven’t these networks been used so often for manufacturing systems? We think there are two main reasons. One is the structure of Jackson networks. Each node (or station) in a manufacturing system usually has only a finite buffer capacity, so a blocking phenomenon may occur. In this case, it is very important to evaluate how the performance parameters such as the production rate (throughput) are affected by blocking. In Jackson networks, however, there is no blocking. The other reason is the service time distribution of jobs at each station. In Jackson networks, this distribution is exponential—an unacceptable situation for practitioners working on manufacturing systems. Of course, there are exceptions in this context, e.g., symmetric queueing networks by Kelly [2]. For these reasons, tandem queues with blocking and general service time distribution at each station have been used in the design or performance evaluation of manufacturing systems such as flow lines, transfer lines, and flexible assembly lines (see, e.g., [7] and [1]).


Service Time Flexible Manufacturing System Single Server Service Time Distribution Service Discipline 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Buzacott, J. A., and Shanthikumar, J. G. Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs, NJ, 1993.zbMATHGoogle Scholar
  2. [2]
    Kelly, F. P. Reversibility and Stochastic Networks. J. Wiley & Sons, New York, 1979.zbMATHGoogle Scholar
  3. [3]
    Miyazawa, M. The derivation of invariance relations in complex queueing systems. Adv. Appl. Prob. 15, 874–885, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Ohi, K. On Tandem Queues with State-Dependent-Service Rate (in Japanese). Master Thesis, Tokyo Metropolitan Institute of Technology, 1995.Google Scholar
  5. [5]
    Walrand, J. An Introduction to Queueing Networks. Prentice-Hall, Englewood Cliffs, NJ, 1988.zbMATHGoogle Scholar
  6. [6]
    Yamazaki, G., Kawashima, T., and Sakasegawa, H. Reversibility of tandem blocking queueing systems. Management Sci. 31, 78–83, 1985.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    Yamazaki, G., Sakasegawa, H., and Shanthikumar, J. G. On optimal arrangement of stations in a tandem queueing system with blocking. Management Sci. 38, 137–153, 1992.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Genji Yamazaki
  • Hirotaka Sakasegawa

There are no affiliations available

Personalised recommendations