Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
نویسنده
چکیده
Motivated by modern call centers, we consider large-scale service systems with multiple server pools and a single customer class. For such systems, we propose a simple routing rule which asymptotically minimizes the steady-state queue length and virtual waiting time. The proposed routing scheme is FSF which assigns customers to the Fastest Servers First. The asymptotic regime considered is the Halfin-Whitt many-server heavy-traffic regime, which we refer to as the Quality and Efficiency Driven (QED) regime; it achieves high levels of both service quality and system efficiency by carefully balancing between the two. Additionally, expressions are provided for system limiting performance measures based on diffusion approximations. Our analysis shows that in the QED regime this heterogeneous server system outperforms its homogeneous server counterpart.
منابع مشابه
Access control in ultra-large-scale systems using a data-centric middleware
The primary characteristic of an Ultra-Large-Scale (ULS) system is ultra-large size on any related dimension. A ULS system is generally considered as a system-of-systems with heterogeneous nodes and autonomous domains. As the size of a system-of-systems grows, and interoperability demand between sub-systems is increased, achieving more scalable and dynamic access control system becomes an im...
متن کاملRouting and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers
Motivated by call centers, we study large-scale service systems with homogeneous impatient customers and heterogeneous servers. The servers differ with respect to their speed of service. For this model, we propose staffing and routing rules that are jointly asymptotically optimal as the system approaches the heavy-traffic many-server QED regime. Our routing rule is FSF, which assigns customers ...
متن کاملBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
In a call center, arriving customers must be routed to available servers, and servers that have just become available must be scheduled to help waiting customers. These dynamic routing and scheduling decisions are very difficult, because customers have different needs and servers have different skill levels. A further complication is that it is preferable that these decisions are made blindly; ...
متن کاملPerformance-based routing
In many-server systems with heterogeneous servers, the Fastest-Server-First (FSF) policy is known for its excellent performance. However, when service rates are unknown and/or time-varying, implementing the FSF policy is not straightforward. We thus propose a routing algorithm, Performance-Based Routing, that approximates the FSF policy: servers are ranked in a dynamic list, where the shorter t...
متن کاملCustomers routing in a queueing system with two heterogeneous servers in speed and in quality of resolution
Heterogeneous servers, in manufacturing and service systems, may have different speeds and different quality levels for the provided service or good. For a two-server queueing model, we formulate the routing problem of minimizing a weighted sum of the expected time in the system and the throughput of unsatisfied customers. Using a Markov decision process approach, we prove that the optimal rout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 51 شماره
صفحات -
تاریخ انتشار 2005