Understanding the marginal impact of customer flexibility

We study the marginal impact of customer flexibility in service systems. We consider a queueing system with multiple parallel servers, in which a proportion of customers are flexible and can go to any server, while the remainder require service at a particular server. We show that the stationary expected waiting time is decreasing and convex in the proportion of flexible customers. We also show, for a related Inventory Model, in which servers are never idle and can build up inventory, that convexity holds in a strong sample-path sense. Our results reinforce the idea that a little flexibility goes a long way.

[1]  P. Sparaggis,et al.  Minimizing response times and queue lengths in systems of parallel queues , 1999 .

[2]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[3]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[4]  S. Turner,et al.  The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.

[5]  George Michailidis,et al.  ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS , 2002, Probability in the Engineering and Informational Sciences.

[6]  Richard F. Serfozo,et al.  Optimality of routing and servicing in dependent parallel processing systems , 1991, Queueing Syst. Theory Appl..

[7]  Wayne L. Winston.  OPTIMALITY OF THE SHORTEST LINE DISCIPLINE , 1977 .

[8]  Ronald W. Wolff,et al.  Multiple-server system with flexible arrivals , 2011, Advances in Applied Probability.

[9]  D. Daley,et al.  Finiteness of Waiting-Time Moments in General Stationary Single-Server Queues , 1992 .

[10]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[11]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[12]  D. McDonald,et al.  Join the shortest queue: stability and exact asymptotics , 2001 .

[13]  Ger Koole,et al.  On the Optimality of the Generalized Shortest Queue Policy , 1990, Probability in the Engineering and Informational Sciences.

[14]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[15]  Douglas G. Down,et al.  On Accommodating Customer Flexibility in Service Systems , 2009, INFOR Inf. Syst. Oper. Res..