Optimal Order for Servers in Series with No Queue Capacity

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.

[1]  Ralph L. Disney,et al.  Applied Probability— Computer Science: The Interface , 1982, Progress in Computer Science.

[2]  Ronald W. Wolff,et al.  The Optimal Order of Service in Tandem Queues , 1974, Oper. Res..

[3]  N. Ling.  The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[4]  Ward Whitt,et al.  Arranging Queues in Series: A Simulation Experiment , 1990 .

[5]  T. Lehtonen.  On the ordering of tandem queues with exponential servers , 1986, Journal of Applied Probability.

[6]  J. Walrand,et al.  On the interchangeability and stochastic ordering of ·/M/1 queues in tandem , 1987, Advances in Applied Probability.

[7]  Gideon Weiss,et al.  On the optimal order of M machines in tandem , 1990 .

[8]  E. Muth.  The Reversibility Property of Production Lines , 1979 .

[9]  Lawrence M. Seiford,et al.  Transient behaviour of finite capacity tandem queues with blocking , 1991 .

[10]  Ronald W. Wolff,et al.  Optimal Order of Servers for Tandem Queues in Light Traffic , 1988 .

[11]  K. Sigman,et al.  On the Interchangeability and Stochastic Ordering of Exponential Queues in Tandem with Blocking , 1989 .

[12]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[13]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[14]  Jie Ding,et al.  Bowl Shapes Are Better with Buffers–Sometimes , 1991 .

[15]  Henry D. Friedman,et al.  Reduction Methods for Tandem Queuing Systems , 1965 .

[16]  Michael Pinedo.  On the Optimal Order of Stations in Tandem Queues , 1982 .

[17]  R. Weber.  THE INTERCHANGEABILITY OF -/M/1 QUEUES IN SERIES , 1979 .

[18]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[19]  Venkat Anantharam.  Probabilistic proof of the interchangeability of ./M/1 queues in series , 1987, Queueing Syst. Theory Appl..

[20]  Genji Yamazaki,et al.  Reversibility of Tandem Blocking Queueing Systems , 1985 .

[21]  J. George Shanthikumar,et al.  On optimal arrangement of stations in a tandem queueing system with blocking , 1992 .

[22]  G. Yamazaki,et al.  Properties of duality in tandem queueing systems , 1975 .

[23]  M. Kulldorff,et al.  Tandem Queueing Systems with Blocking , 1986 .

[24]  J. George Shanthikumar,et al.  Characterization of optimal order of servers in a tandem queue with blocking , 1991, Oper. Res. Lett..

[25]  Ward Whitt,et al.  The Best Order for Queues in Series , 1985 .