Allocation of service time in a two-server system

Consider a two-server FCFS queueing model where servers are arranged in series. All arrivals join the first service center where they receive a maximum of T units of service. Arrivals with service requirements that exceed the threshold T join the second queue where they receive their remaining service. We show that when the service requirements have hyper-exponential service times with large coefficient of variation our scheme provides better system performance than the standard two parallel server model in the sense of reducing the mean delay per customer in the system. Our model is likely to be useful in systems where high variability is a cause of performance degradation and where numerous service interruptions are not desirable.

[1]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

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

[3]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[4]  G. Cosmetatos.  Notes Approximate Explicit Formulae For The Average Queueing Time In The Processes (M/D/r) and (D/M/r) , 1975 .

[5]  Martin J. Fischer,et al.  Using quantile estimates in simulating Internet queues with Pareto service times , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[6]  Per Hokstad,et al.  On the steady-state solution of the M/G/2 queue , 1979, Advances in Applied Probability.

[7]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[8]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[9]  M. Neuts,et al.  Introduction to Queueing Theory (2nd ed.). , 1983 .

[10]  Mor Harchol-Balter.  Task assignment with unknown duration , 2002, JACM.

[11]  Ward Whitt,et al.  Partitioning Customers Into Service Groups , 1999 .

[12]  Peter C. Kiessler,et al.  Traffic Processes in Queueing Networks , 1987 .

[13]  Dimitris Bertsimas,et al.  The Distributional Little's Law and Its Applications , 1995, Oper. Res..

[14]  John N. Daigle,et al.  A Little's Result Approach to the Service Constrained Spares Provisioning Problem for Repairable Items , 1997, Oper. Res..

[15]  J. Medhi,et al.  Stochastic models in queueing theory , 1991 .

[16]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[17]  Eric Torng,et al.  New directions in machine scheduling , 2000 .

[18]  W. Whitt.  Planning queueing simulations , 1989 .

[19]  Avishai Mandelbaum,et al.  On Pooling in Queueing Networks , 1998 .

[20]  Nadim E. Abboud,et al.  The Markovian Two-echelon Repairable Item Provisioning Problem , 1996 .

[21]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[22]  WhittWard.  Approximating a Point Process by a Renewal Process, I , 1982 .

[23]  Jon W. Mark,et al.  Approximation of the Mean Queue Length of an M/G/c Queueing System , 1995, Oper. Res..

[24]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[25]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..