Call-Routing Schemes for Call-Center Outsourcing
Manufacturing & Service Operations Management
Allocation of jobs and identical resources with two pooling centers
Queueing Systems: Theory and Applications
Allocation of Service Time in a Multiserver System
Management Science
Understanding internet video sharing site workload: a view from data center design
Proceedings of the 17th international conference on World Wide Web
Resilient workload manager: taming bursty workload of scaling internet applications
ICAC-INDST '09 Proceedings of the 6th international conference industry session on Autonomic computing and communications industry session
Partitioning of Servers in Queueing Systems During Rush Hour
Manufacturing & Service Operations Management
Understanding Internet Video sharing site workload: A view from data center design
Journal of Visual Communication and Image Representation
Optimal allocation of servers and processing time in a load balancing system
Computers and Operations Research
Intelligent Analysis of Acute Bed Overflow in a Tertiary Hospital in Singapore
Journal of Medical Systems
Hi-index | 0.01 |
We explore the issues of when and how to partition arriving customers into service groups that will be served separately, in a first-come first-served manner, by multiserver service systems having a provision for waiting, and how to assign an appropriate number of servers to each group. We assume that customers can be classified upon arrival, so that different service groups can have different service-time distributions. We provide methodology for quantifying the tradeoff between economies of scale associated with larger systems and the benefit of having customers with shorter service times separated from other customers with longer service times, as is done in service systems with express lines. To properly quantify this tradeoff, it is important to characterize service-time distributions beyond their means. In particular, it is important to also determine the variance of the service-time distribution of each service group. Assuming Poisson arrival processes, we then can model the congestion experienced by each server group as an M/G/s queue with unlimited waiting room. We use previously developed approximations for M/G/s performance measures to quickly evaluate alternative partitions.