Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs

DOI10.1023/A:1022642624300zbMath0949.90015OpenAlexW3212027522MaRDI QIDQ1289399

S. Humair, L. D. Servi

Publication date: 28 November 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022642624300

zbMATH Keywords

call centersconvex quadratic programmingaffine scaling methodrate estimation\(M/M/k\) queuesBernoulli routing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Communication theory (94A05)

Related Items

OPTIMAL BERNOULLI ROUTING IN AN UNRELIABLE M/G/1 RETRIAL QUEUE ⋮ COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Certain optimality properties of the first-come first-served discipline for G/G/s queues
• Approximation of multichannel queueing systems
• Comparison of servicing strategies in multichannel queueing systems
• Optimality of routing and servicing in dependent parallel processing systems
• Upper bounds on work in system for multichannel queues
• Optimal control of two interacting service stations
• On the Optimality of the Generalized Shortest Queue Policy
• On the Assignment of Customers to Parallel Queues
• A new ordering for stochastic majorization: theory and applications
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Optimality of the shortest line discipline
• An upper bound for multi-channel queues
• Optimality of the round-robin routing policy