Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Deciding which queue to join: Some counterexamples
Operations Research
Comparison of policies for routing customers to parallel queueing systems
Operations Research
Brownian networks with discretionary routing
Operations Research
Optimal load balancing and scheduling in a distributed computer system
Journal of the ACM (JACM)
Optimality of routing and servicing in dependent parallel processing systems
Queueing Systems: Theory and Applications
Optimal Control: Basics and Beyond
Optimal Control: Basics and Beyond
Critical Thresholds for Dynamic Routing in Queueing Networks
Queueing Systems: Theory and Applications
Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs
Queueing Systems: Theory and Applications
A Call-Routing Problem with Service-Level Constraints
Operations Research
Optimal Routing In Output-Queued Flexible Server Systems
Probability in the Engineering and Informational Sciences
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
A Staffing Algorithm for Call Centers with Skill-Based Routing
Manufacturing & Service Operations Management
Contact Centers with a Call-Back Option and Real-Time Delay Information
Operations Research
Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime
Mathematics of Operations Research
Maximizing the throughput of tandem lines with flexible failure-prone servers and finite buffers
Probability in the Engineering and Informational Sciences
Dynamic Scheduling of Outpatient Appointments Under Patient No-Shows and Cancellations
Manufacturing & Service Operations Management
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We consider a network of parallel service stations each modeled as a single-server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in the system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average waiting cost, we develop two heuristic routing policies, one of which is based on dynamic programming policy improvement and the other on Lagrangian relaxation. In developing the latter policy, we show that each station is “indexable” under mild conditions for customers’ waiting costs and also prove some structural results on the admission control problem that naturally arises as a result of the Lagrangian relaxation. We then test the performance of our heuristics in an extensive numerical study and show that the Lagrangian heuristic demonstrates a strong level of performance in a range of traffic conditions. In particular, it clearly outperforms both a greedy heuristic, which is a standard proposal in complex routing problems, and a recent proposal from the heavy traffic literature.