Partitioning Customers into Service Groups

DOI10.1287/MNSC.45.11.1579MaRDI QIDQ4950973zbMATH OpenOpenAlexFDO

Authors Ward Whitt

Publication date 26 September 2000

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/da2b7197c509f80c583be8e159957e7f4b021bfe

zbMATH Keywords

multiserver queuesqueuesresource sharingservice systemsservice systems with express linesservice-system design

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• A heuristic rule for routing customers to parallel servers
• Group-server queues
• The influence of servicing times in queuing processes
• scientific article; zbMATH DE number 836622
• Queueing system with parallel service of group calls

Cited in

(13)

• Pooling is not the answer
• Optimization of express line performance: numerical examination and management considerations
• Grouping customers for better allocation of resources to serve correlated demands
• A multi-station system for reducing congestion in high-variability queues
• On a bicriterion server allocation problem in a multidimensional Erlang loss system
• Cross-training workers in dual resource constrained systems with heterogeneous processing times
• Capacity reservation for time-sensitive service providers: an application in seaport management
• Resource Pooling and Cost Allocation Among Independent Service Providers
• Efficiency evaluation for pooling resources in health care
• To pool or not to pool: queueing design for large-scale service systems
• To pool or not to pool in hospitals: a theoretical and practical comparison for a radiotherapy outpatient department
• Allocation of jobs and identical resources with two pooling centers
• Optimal allocation of servers and processing time in a load balancing system

This page was built for publication: Partitioning Customers into Service Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950973)