Multiple-server system with flexible arrivals
Authors:
- 1 December 2011
- journal article
- general applied-probability
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 43 (04) , 985-1004
Abstract
In many service, production, and traffic systems there are multiple types of customers requiring different types of ‘servers’, i.e. different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e. they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We generalize earlier results on the optimality of ‘join the shortest queue’ (JSQ) for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Surprisingly, with abandonments, the optimality of JSQ for minimizing the number of customers in the system depends on the relative abandonment and service rates. We extend our model to finite buffers and resequencing. We assume exponential service. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense.Keywords
This publication has 26 references indexed in Scilit:
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEMProbability in the Engineering and Informational Sciences, 2009
- ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTSProbability in the Engineering and Informational Sciences, 2002
- Minimizing response times and queue lengths in systems of parallel queuesJournal of Applied Probability, 1999
- Optimal Routing and Scheduling of Customers with DeadlinesProbability in the Engineering and Informational Sciences, 1994
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service ratesJournal of Applied Probability, 1993
- Optimality of routing and servicing in dependent parallel processing systemsQueueing Systems, 1991
- On the Optimality of the Generalized Shortest Queue PolicyProbability in the Engineering and Informational Sciences, 1990
- Analysis of the resequencing delay for M/M/m systemsACM SIGMETRICS Performance Evaluation Review, 1987
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978
- Multiplicities and Minimal Widths for (0, 1)-MatricesCanadian Journal of Mathematics, 1962