Skip to main content
SpringerLink
Log in

Allocation of buffer capacities in queueing networks with arbitrary topologies

  • Optimization And Control
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Two algorithms are developed to allocateM buffers toN service stations connected arbitrarily in a feed-forward manner. All service times and the interarrival times are assumed to be exponentially distributed. Both methodologies are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I.F. Akyildiz and H.G. Perros (eds.), Special Issue onQueueing Networks with Finite Capacity Queues, Perf. Eval. 10-3 (1989).

  2. T. Altiok and S. Stidham, The allocation of interstage buffer capacities in production lines, IIE Trans. 15 (1983) 292–299.

    Google Scholar 

  3. J. Buzacott, Automatic transfer lines with buffer stocks, Int. J. Prod. Res. 5 (1967) 183–200.

    Google Scholar 

  4. J. Buzacott, Prediction of the efficiency of production systems without internal storage, Int. J. Prod. Res. 6 (1968) 173–188.

    Google Scholar 

  5. J. Buzacott, The role of inventory banks in flow line production systems, Int. J. Prod. Res. 9 (1971) 425–436.

    Google Scholar 

  6. J. Buzacott and J.G. Shanthikumar, Design of manufacturing systems using queueing models, Queueing Syst. 12 (1992) 135–214.

    Article  Google Scholar 

  7. B. Gavish, A general model for topological design of computer networks,Proc. Globecom '86 (1986).

  8. B. Gavish and I. Neuman, Capacity and flow assignments in large computer networks,Proc. IEEE Infocom '86 (1986) pp. 275–284.

  9. S.B. Gershwin, An efficient decomposition method for the approximate evaluation of production lines with finite storage space,6th INRIA Conf. Proc., Nice, France (1984).

  10. S.B. Gershwin, An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking, Oper. Res. 35 (1987) 291–305.

    Google Scholar 

  11. F.S. Hillier and W. Boling, The effect of some design factors on the efficiency of production lines with variable operation times, J. Ind. Eng. 7 (1966) 651–658

    Google Scholar 

  12. F.S. Hillier and W. Boling, Finite queues in series exponential or Erlang service times — A numerical approach, Oper. Res. 15 (1969) 286–303.

    Google Scholar 

  13. F.S. Hillier and W. Boling, On the optimal allocation of work in symmetrically unbalanced production line systems with variable operation times, Manag. Sci. 25 (1979) 721–728.

    Google Scholar 

  14. M.A. Jafari and J.G. Shanthikumar, Determination of optimal buffer storage capacities and optimal allocation in multistage automatic transfer lines, IIE Trans. 21-2 (1989) 130–135.

    Google Scholar 

  15. P. Kubat and U. Sumita, Buffers and backup machines in automatic transfer lines, Int. J. Prod. Res. 23 (1985) 1259–1280.

    Google Scholar 

  16. J. MacGregor Smith and S. Daskalaki, Buffer space allocation in automated assembly lines, Oper. Res. 36 (1988) 343–358.

    Article  Google Scholar 

  17. MARCA, Markov chain analyzer, W. Stewart, Department of Computer Science, North Carolina State University, Raleigh, NC (1991).

  18. R.O. Onvural, A survey of closed queueing networks with blocking, ACM Comp. Surveys 22 (1990) 83–122.

    Article  Google Scholar 

  19. R.O. Onvural and H.G. Perros, On equivalences of blocking mechanisms in queueing networks with blocking, Oper. Res. Lett. 5 (1976) 293–297.

    Article  Google Scholar 

  20. H.G. Perros, Open queueing networks with blocking, in:Stochastic Analysis of Computer and Communications Systems, ed. H. Takagi (North-Holland, 1990).

  21. B. A. Sevastyonov, Influence of storage bin capacity on the average, standstill time of production lines, Theory Prob. Appl. 7 (1962) 429–438.

    Article  Google Scholar 

  22. T.J. Sheskin, Allocation of interstage storage along an automated production line, AIIE Trans. 8 (1976) 146–152.

    Google Scholar 

  23. A.L. Soyster, J.W. Schmidt and M.W. Rohrer, Allocation of buffer capacities for a class of fixed cycle production lines, AIIE Trans. 11 (1979) 140–146.

    Google Scholar 

  24. H. Yamashita and S. Suzuki, An approximate solution method for optimal buffer allocation in serialn-stage automatic production lines, Trans. Japan. Soc. Mech. Eng. 53-C (1987) 807–814 (in Japanese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Sophia University, Tokyo, Japan

    Hideaki Yamashita

  2. IBM, E95A/673, 27709, Research Triangle Park, NC, USA

    Raif O. Onvural

Authors
  1. Hideaki Yamashita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raif O. Onvural
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was done while the author was on a sabbatical leave of absence at North Carolina State University, Raleigh, North Carolina.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamashita, H., Onvural, R.O. Allocation of buffer capacities in queueing networks with arbitrary topologies. Ann Oper Res 48, 313–332 (1994). https://doi.org/10.1007/BF02024519

Download citation

  • Issue Date:

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

Keywords

Search

Navigation