Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-06T10:06:10.459Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Order for Servers in Series with No Queue Capacity

Published online by Cambridge University Press:  27 July 2009

Jie Ding  and
Betsy S. Greenberg
Jie Ding
Affiliation:
Management Department
Betsy S. Greenberg
Affiliation:
Management Science and Information Systems DepartmentThe University of Texas, at Austin Austin, Texas 78712
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we consider the problem of finding the optimal order for two servers in series when there is no queue capacity. We show that it is better for the faster server to be first. The strength of this conclusion will depend on the strength of the assumption made about the service distribution. We also find the optimal order for some systems where both servers have the same average service time and different service distributions.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 5 , Issue 4 , October 1991 , pp. 449 - 461
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Anantharam, V. (1987). Probabilistic proof of the interchangeability of /M/l queues in series. Queueing Systems 2: 387–392.Google Scholar
Bailey, N.T.J. (1975). The mathematical theory of infectious diseases and its applications. New York: Hafner Press.Google Scholar
Barlow, R.E. & Proschan, F. (1975). Statistical theory of reliability and life testing: Probability models. New York: Holt, Rinehart and Winston.Google Scholar
Chao, X., Pinedo, M., & Sigman, K. (1988). On the interchangeability and stochastic ordering of exponential queues in tandem with blocking. Probability in the Engineering and Informational Sciences 3: 223–236.CrossRefGoogle Scholar
Daley, D.J. (The Australian National University, Canberra). (1989). Personal communication.Google Scholar
Dattatreya, E. (1978). Tandem queueing systems with blocking. Ph.D. dissertation, Industrial Engineering and Operations Research, University of California, Berkeley, CA.Google Scholar
Ding, J. & Greenberg, B.S. (1989). Optimal order of servers in series with no queue capacity. Center for Statistical Sciences, The University of Texas at Austin.Google Scholar
Ding, J. & Greenberg, B.S. (1991). Bowl shapes are better with buffers–Sometimes. Probability in the Engineering and Informational Sciences 5: 159–169.CrossRefGoogle Scholar
Friedman, H.D. (1965). Reduction methods for tandem queueing systems. Operations Research 13: 121–131.CrossRefGoogle Scholar
Greenberg, B.S. & Wolff, R.W. (1988). Optimal order of servers for tandem queues in light traffic. Management Science 34: 500–508.Google Scholar
Huang, C.C. & Weiss, G. (1990). On the optimal order of M machines in tandem. Operations Research Letters 9: 299–303.CrossRefGoogle Scholar
Klutke, G.-A. & Seiford, L. (1991). Transient behavior of tandem queues: Finite capacity systems with blocking. International Journal of Systems Science (to appear).CrossRefGoogle Scholar
Lehtonen, T. (1986). On the ordering of tandem queues with exponential servers. Journal of Applied Probability 23: 115–129.CrossRefGoogle Scholar
Muth, E. (1979). The reversibility property of production lines. Management Science 25: 152–159.CrossRefGoogle Scholar
Pinedo, M. (1982). Minimizing the expected makespan in stochastic flow shop. Operations Research 30: 148–162.CrossRefGoogle Scholar
Pinedo, M. (1982). On the optimal order of stations in tandem queues. In Disney, R.L. & Ott, T.J. (eds.), Applied probability–Computer science: The interface, Vol. II. Boston: Birkhauser, pp. 307–325.CrossRefGoogle Scholar
Ross, S. (1982). Stochastic processes. New York: Wiley.Google Scholar
Shanthikumar, J.G., Yamazaki, G., & Sakasegawa, H. (1991). Characterization of optimal order of servers in a tandem queue with blocking. Operations Research Letters 10: 17–22.Google Scholar
Suresh, S. & Whitt, W. (1990). Arranging queues in series: A simulation experiment. Management Science 36: 1080–1091.Google Scholar
Tembe, S.V. & Wolff, R.W. (1974). The optimal order of service in tandem queues. Operations Research 24: 824–832.CrossRefGoogle Scholar
Tscoucas, P. & Walrand, J. (1987). On the interchangeability and stochastic ordering of /M/1 queues in tandem. Advances in Applied Probability 19: 515–520.Google Scholar
Weber, R.R. (1979). The interchangeability of tandem /M/1 queues in series. Journal of Applied Probability 16: 690–695.CrossRefGoogle Scholar
Whitt, W. (1985). The best order for queues in series. Management Science 31: 475–487.CrossRefGoogle Scholar
Yamazaki, G., Kawashima, T., & Sakasegawa, H. (1985). Reversibility of tandem blocking queueing systems. Management Science 31: 78–83.CrossRefGoogle Scholar
Yamazaki, G. & Sakasegawa, H. (1975). Properties of duality in tandem queueing systems. Annals of the Institute of Statistical Mathematics 27: 201–212.Google Scholar
Yamazaki, G., Sakasegawa, H., & Shanthikumar, J.G. (1992). On optimal arrangement of stations in tandem queueing systems with blocking. Management Science (to appear).CrossRefGoogle Scholar