Skip to main content
SpringerLink
Log in

Bounding the performance of tandem queues with finite buffer spaces

  • Computational Methods
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a queueing system with three single servers in tandem with two intermediate buffer storages of finite capacity. The processing times are exponentially distributed and the first server has unlimited number of customers in front of it. Using a negative dependence property between the number of customers at the first and second buffer storages we show that a popular form of decomposition approach applied to this model, indeed, provides a lower bound for its performance. The approach used here to establish the bound is new and could be extended to establish bounds for other types of tandem queues with finite buffer spaces.

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. T. Altiok, Approximate analysis of exponential tandem queues with blocking, Eur. J. Oper. Res. 11 (1982) 390–398.

    Article  Google Scholar 

  2. T. Altiok and S. Stidham, A note on transfer lines with unreliable machines, random processing times and finite buffers, IIE Trans. 14 (1982) 125–127.

    Google Scholar 

  3. R. Barlow and F. Proschan,Statistical Theory of Reliability and Life Testing: Probability Models (To Begin With, Silver Spring, MD, 1981).

  4. O. Boxma and A. Konheim, Approximate analysis of exponential queueing systems with blocking, Acta Inf. 15 (1981) 19–66.

    Article  Google Scholar 

  5. M.A. Jafari and J.G. Shanthikumar, An approximate model of multistage automatic transfer lines with possible scrapping of workpieces, IIE Trans. 19 (1987).

  6. J. Keilson,Markov Chain Models — Rarity and Exponentiality (Springer, New York, NY, 1979).

    Google Scholar 

  7. H.G. Perros, A survey of queueing networks with blocking, Technical Report, Dept. of Computer Science, North Carolina State University, Raleigh, NC 27695 (1986).

    Google Scholar 

  8. J.G. Shanthikumar and D.D. Yao, The preservation of likelihood ratio ordering under convolution, Stoch. Proc. Appl. 23 (1986) 259–267.

    Article  Google Scholar 

  9. N.M. Van Dijk and B.F. Lamond, Simple bounds for finite single-server exponential tandem queues, Oper. Res. 36 (1988) 470–477.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of California, 94720, Berkeley, CA, USA

    J. George Shanthikumar

  2. Department of Industrial Engineering, Rutgers University, 08854, Piscataway, NJ, USA

    Mohsen A. Jafari

Authors
  1. J. George Shanthikumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohsen A. Jafari
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

George Shanthikumar, J., Jafari, M.A. Bounding the performance of tandem queues with finite buffer spaces. Ann Oper Res 48, 185–195 (1994). https://doi.org/10.1007/BF02024664

Download citation

  • Issue Date:

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

Keywords

Search

Navigation