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

Journal of Optimization Theory and Applications

Volumn 100, Issue 3, 1999, Pages 623-659

  Servi, L D ^a   Humair, S ^b  

^a VERIZON   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBABILITY; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

ARRIVAL RATES; BALANCING LOADS; BERNOULLI; CALL CENTERS; DISCRETE TIME; PROBABILITY ASSIGNMENT; ROUTING POLICIES; ROUTING PROBABILITIES; ROUTINGS; TRANSMISSION COSTS;

OPTIMAL SYSTEMS;

EID: 0033096410     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022642624300     Document Type: Article

References (25)

1. 1. KOOLE, G., Queueing-Theoretic Solution Methods for Models of Parallel and Distributed Systems, Technical Report BS-R9425, CWI, Amsterdam, Holland, 1994.
2. 2. GELENBE, E., and PEKERGIN, F., Load Balancing Pragmatics, Technical Report, EHEI Université René Descartes, 1993.
3. 3. WANG, Y. T., and MORRIS, R. J. T., Load Sharing in Distributed Systems, IEEE Transactions on Computers, Vol. 34, pp. 204-217, 1985.
4. 4. WINSTON, W., Optimality of the Shortest Line Discipline, Journal of Applied Probability, Vol. 14, pp. 181-189, 1977.
5. 5. CHANG, C. S., A New Ordering for Stochastic Majorization, Advances in Applied Probability, Vol. 24, pp. 604-634, 1992.
6. 6. GROSS, H. D., and HARRIS, C. M., Fundamentals of Queueing Theory, Vol. 1, John Wiley and Sons, New York, New York, 1974.
7. 7. KOOLE, G., On the Optimality of the Generalized Shortest Queue Policy, Probability in the Engineering and Informational Sciences, Vol. 4, pp. 477-487, 1990.
8. 8. KOOLE, G., On the Optimality of FCFS for Networks of Multi-Server Queues, Technical Report BS-R9235, CWI, Amsterdam, Holland, 1992.
9. 9. MENICH, R., and SERFOZO, R. F., Monotonicity and Optimality of Symmetric Parallel Processing Systems, Queueing Systems: Theory and Applications, Vol. 9, pp. 403-418, 1991.
10. 10. TOWSLEY, D., SPARAGGIS, P. D., and CASSANDRAS, C. G., Optimal Routing and Buffer Allocation for a Class of Finite Capacity Queueing Systems, IEEE Transactions on Automatic Control, Vol. 37, pp. 1446-1451, 1992.
11. 11. TOWSLEY, D., and SPARAGGIS, P. D., Optimal Routing in Systems with ILR Service Distributions, CMPCSI Technical Report, University of Massachusetts at Amherst, 1993.
12. 12. SHENKER, S., and WEINRIB, W., The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routine, IEEE Transactions on Computers, Vol. 38, pp. 1724-1735, 1989.
13. 13. WALRAND, J., An Introduction to Queueing Networks, Vol. 1, Prentice Hall, Englewood Cliffs, New York, 1988.
14. 14. LIU, Z., and TOWSLEY, D., Optimality of the Round Robin Routing Policy, Coins Technical Report 92-55, University of Massachusetts, 1992.
15. 15. HAJEK, B., Optimal Control of Two Interacting Service Stations, IEEE Transactions on Automatic Control, Vol. 29, pp. 491-499, 1984.
16. 16. HORDIJK, A., and KOOLE, G., On the Assignment of Customers to Parallel Queues, Probability in the Engineering and Informational Sciences, Vol. 6, pp. 495-511, 1992.
17. 17. WOLFF, R. W., An Upper Bound for Multichannel Queues, Journal of Applied Probability, Vol. 14, pp. 884-888, 1977.
18. 18. WOLFF, R. W., Upper Bounds far Work in System for Multichannel Queues, Journal of Applied Probability, Vol. 24, pp. 547-551, 1987.
19. 19. DALEY, D. J., Certain Optimality Properties of the First-Come First-Served Discipline for G/G/s Queues, Stochastic Processes and Their Applications, Vol. 25, pp. 301-308, 1987.
20. 20. FOSS, S. G., Approximation of Multi-Channel Queuing Systems, Siberian Mathematical Journal, Vol. 21, pp. 851-857, 1981.
21. 21. FOSS, S. G., Comparison of Servicing Strategies in Multichannel Queueing Systems, Siberian Mathematical Journal, Vol. 22, pp. 142-147, 1981.
22. 22. BOEL, R. K., and VAN SCHUPPEN, J. H., Distributed Routing for Load Balancing, Proceedings of the IEEE, Vol. 77, pp. 210-221, 1989.
23. 23. BERTSEKAS, D., Dynamic Programming and Optimal Control, Vol. 1, Athena Scientific, Belmont, Massachusetts, 1995.
24. 24. BAZARAA, M. S., SHERALI, H. D., and SHETTY, C. M., Nonlinear Programming: Theory and Algorithms, John Wiley and Sons, New York, New York, 1993.
25. 25. PRESS, W. H., et al., Numerical Recipes in C: the Art of Scientific Computing, Vol. 1, Cambridge University Press, New York, New York, 1988.