Skip to main content
Log in

Tandem queue with group arrivals and no intermediate buffer

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study a system with two single-server stations in series. There is an infinite buffer in front of the first station and no buffer between the two stations. The customers come in groups; the groups contain random numbers of customers and arrive according to a Poisson process. Assuming general service time distributions at the two stations, we derive the Laplace transform and the recursive formula for the moments of the total time spent in the tandem system (waiting time in the system) by an arbitrary customer. From the Laplace transform, we conclude that the optimal order of the servers for minimizing the waiting time in the system does not depend on the group size.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. Avi-Itzhak and M. Yadin, A sequence of two servers with no intermediate queues, Manag. Sci. 11 (1965) 553–564.

    Google Scholar 

  2. X. Chao and M. Pinedo, Batch arrivals to a tandem queue without an intermediate buffer, Stoch. Models 6 (1990) 735–748.

    Google Scholar 

  3. X. Chao, M. Pinedo and K. Sigman, On the interchangeability and stochastic ordering of exponential queues in tandem with blocking, Prob. Eng. Inf. Sci. 3 (1989) 223–236.

    Google Scholar 

  4. M.L. Chaudhry and J.G.C. Templeton,A First Course in Bulk Queues3 (Wiley, New York, 1985).

    Google Scholar 

  5. W.B. Gong and J.Q. Hu, The Maclaurin expansion for theGI/G/1 queue, J. Appl. Prob. 29 (1992) 176–184

    Google Scholar 

  6. B.R.K. Kashyap and M.L. Chaudhry,An introduction to Queueing Theory (A & A Publ., Canada, 1988).

    Google Scholar 

  7. N.U. Prabhu, Transient behavior of a tandem queue, Manag. Sci. 13 (1967) 631–639.

    Google Scholar 

  8. S. Ross,Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  9. J.G. Shanthikumar and U. Sumita, Modified Lindley process with replacement: dynamic behavior, asymptotic decomposition and application, J. Appl. Prob. 26 (1989) 552–565.

    Google Scholar 

  10. J.G. Shanthikumar, G. Yamazaki and H. Sakasegawa, Characterization of optimal order of servers in a tandem queue with blocking, Oper. Res. Lett. 10 (1991) 17–22.

    Google Scholar 

  11. P. Welch, On a generalized queueing processM/G/1 in which the first customer of each busy period receives exceptional service, Oper. Res. 12 (1964).

  12. Y. Zhu, On the ordering of ·/G/1 queues in series with blocking, Department of Industrial Engineering, SUNY Buffalo, NY (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, Y. Tandem queue with group arrivals and no intermediate buffer. Queueing Syst 17, 403–412 (1994). https://doi.org/10.1007/BF01158701

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation