Skip to main content

An approximation method for queueing network with a common buffer and blocking

  • Stochastic Systems And Models
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 143))

  • 163 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altiok, T. (1982) Approximate Analysis of Exponential Tandem Queues with Blocking. Eur. J. Opns. Res. 11, 390–398.

    Google Scholar 

  2. Brandwajn, A. and Jow, Y.L. (1988) An Approximation Method for Tandem Queues with Blocking. Opns. Res. 36, 73–83.

    Google Scholar 

  3. Buzacott, J.A. and Shanthikumar, J.G. (1980) Models for Understanding Flexible Manufacturing Systems. AIIE Trans. 12, 339–349.

    Google Scholar 

  4. Choong, Y.F. and Gershwin, S.B. (1987) A Decomposition Method for the Approximate Evaluation of Capacitated Transfer Lines with Unreliable Machines and Random Processing Times. IIE Trans. 19, 150–159.

    Google Scholar 

  5. Gershwin, S.B. (1987) An Efficient Decomposition Method for Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking. Opns. Res. 35, 291–305.

    Google Scholar 

  6. Jackson, J.R. (1957) Networks of Waiting Lines. Opns. Res. 5, 518–521.

    Google Scholar 

  7. Jackson, J.R. (1963) Jobshop-Like Queueing Systems. Mgmt. Sci. 10, 131–142.

    Google Scholar 

  8. Schweitzer, P.J. (1977) Maximum Throughput in Finite-Capacity Open Queueing Networks with Product-Form Solutions. Mgmt Sci. 24, 217–223.

    Google Scholar 

  9. Suri, R. and Diehl, G.W. (1986) A Variable Buffer-Size Model and its Use in Analyzing Closed Queueing Networks with Blocking. Mgmt. Sci. 32, 206–224.

    Google Scholar 

  10. Takahashi, Y., Miyahara, H. and Hasegawa, T. (1980) An Approximation Method for Open Restricted Queueing Network. Opns. Res. 28, 594–602.

    Google Scholar 

  11. Yamashita, H. and Suzuki, S. (1987) An Approximate Solution Method for Optimal Buffer Allocation in Serial n-Stage Automatic Production Lines. Trans. Japan Soc. Mech. Engrs. 53-C, 807–814.

    Google Scholar 

  12. Yamashita, H. and Suzuki, S. (1988) The Modeling and Analysis of a Production Line Operated According to Demands. Trans. Japan Soc. Mech. Engrs. 54-C, 1362–1369.

    Google Scholar 

  13. Yamashita, H. and Suzuki, S. (1988) An Approximation Method for Line Production Rate of a Serial Production Line with a Common Buffer. Comput. Opns. Res. 15, 395–402.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. -J. Sebastian K. Tammer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 International Federation for Information Processing

About this paper

Cite this paper

Yamashita, H. (1990). An approximation method for queueing network with a common buffer and blocking. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008426

Download citation

  • DOI: https://doi.org/10.1007/BFb0008426

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52659-9

  • Online ISBN: 978-3-540-47095-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics