Queueing Systems: Theory and Applications
Inequalities for Queues with a Learning Server
Queueing Systems: Theory and Applications
Partial Pooling in Tandem Lines with Cooperation and Blocking
Queueing Systems: Theory and Applications
Call-Routing Schemes for Call-Center Outsourcing
Manufacturing & Service Operations Management
How many servers are best in a dual-priority M/PH/k system?
Performance Evaluation
Allocation of Service Time in a Multiserver System
Management Science
A Staffing Algorithm for Call Centers with Skill-Based Routing
Manufacturing & Service Operations Management
A simulation study of interventions to reduce appointment lead-time and patient no-show rate
Proceedings of the 40th Conference on Winter Simulation
Queueing system topologies with limited flexibility
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Cost sharing of cooperating queues in a Jackson network
Queueing Systems: Theory and Applications
| Hi-index | 0.01 |
We view each station in a Jackson network as a queue of tasks, of a particular type, which are to be processed by the associated specialized server. A complete pooling of queues, into a single queue, and servers, into a single server, gives rise to an M/PH/1 queue, where the server is flexible in the sense that it processes all tasks. We assess the value of complete pooling by comparing the steady-state mean sojourn times of these two systems. The main insight from our analysis is that care must be used in pooling. Sometimes pooling helps, sometimes it hurts, and its effect (good or bad) can be unbounded. Also discussed briefly are alternative pooling scenarios, for example complete pooling of only queues which results in an M/PH/S system, or partial pooling which can be devastating enough to turn a stable Jackson network into an unstable Bramson network. We conclude with some possible future research directions.