Skip to main content
Log in

Comparing ordered-entry queues with heterogeneous servers

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study a queueing system withm exponential servers with distinct service rates. Jobs arrive at the system following an arbitrary point process. Arrived jobs receive service at the first unoccupied server (if any) according to an entry order π, which is a permutation of the integers 1, 2,...,m. The system has a finite buffer capacity. When the buffer limit is reached, arrivals will be blocked. Blocked jobs will either be lost or come back as New arrivals after a random travel time. We are concerned with the dynamic stochastic behavior of the system under different entry orders. A partial ordering is established among entry orders, and is shown to result in some quite strong orderings among the associated stochastic processes that reflect the congestion and the service characteristics of the system. The results developed here complement existing comparison results for queues with homogeneous servers, and can be applied to aid the design of conveyor and communication systems.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. R.B. Cooper, Queues with ordered servers that work at different rates, Opsearch 13(1976)69.

    Google Scholar 

  2. Y.L. Deng, On the comparison of point processes, J. Appl. Prob. 22(1985)300.

    Google Scholar 

  3. R.L. Disney, Some multichannel queueing problems with ordered entry — An application to conveyor theory, J. Industrial Eng. 14(1963)105.

    Google Scholar 

  4. T. Kamae, U. Krengel and G. O'Brien, Stochastic inequalities on partially ordered spaces, Ann. Prob. 5(1977)899.

    Google Scholar 

  5. A.W. Marshall and I. Olkin,Inequalities: Theory of Majorization and Its Applications (Academic Press, New York, 1979).

    Google Scholar 

  6. W.M. Nawijn, A note on many-server queueing systems with ordered entry, with an application to conveyor theory, J. Appl. Prob. 20(1983)144.

    Google Scholar 

  7. B. Pourbabai and D. Sonderman, Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers, J. Appl. Prob. 23(1986)236.

    Google Scholar 

  8. D. Sonderman, Comparing multi-server queues with finite waiting rooms, I: Same number of servers, II: Different number of servers, Adv. Appl. Prob. 11(1979)439; 448.

    Google Scholar 

  9. D. Stoyan,Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).

    Google Scholar 

  10. W. Whitt, Comparing counting processes and queues, Adv. Appl. Prob. 13(1981)207.

    Google Scholar 

  11. T. Yanagimoto and M. Okamoto, Partial orderings of permutations and monotonicity of a rank correlation statistic, Ann. Inst. Statist. Math. 21(1969)489.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shanthikumar, J.G., Yao, D.D. Comparing ordered-entry queues with heterogeneous servers. Queueing Syst 2, 235–244 (1987). https://doi.org/10.1007/BF01158900

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation