Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing

References

• Asmussen S.Applied Probability and Queues (2003) (Springer-Verlag, New York) Google Scholar
• Atar R. A diffusion model of scheduling control in queueing systems with many servers. Ann. Appl. Probab. (2005) 15(1B):820–852Crossref, Google Scholar
• Billingsley P.Convergence of Probability Measures (1999) (Wiley, New York) Crossref, Google Scholar
• Caldentey R. A., Kaplan E. H. A heavy-traffic approximation for queues with restricted customer-server matchings. (2002) . Working paper, Yale University, New Haven, CTGoogle Scholar
• Chen H., Yao D. D.Fundamentals of Queueing Networks (2001) (Springer-Verlag, New York) Crossref, Google Scholar
• Daley D. J., Vere-Jones D.An Introduction to the Theory of Point Processes (1988) (Springer-Verlag, New York) Google Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141Link, Google Scholar
• Garnett O., Mandelbaum A. An introduction to skills-based routing and its operational complexities. (2000) . http://iew3.technion.ac.il/serveng/Lectures/SBR.pdfGoogle Scholar
• Gurvich I., Whitt W. Service-level differentiation in many-server service systems: A solution based on fixed-queue-ratio routing. (2007) . Working paper, Columbia University, New York, http://www.columbia.edu/∼ww2040Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–588Link, Google Scholar
• Johnson M. P. Tenant-based subsidized housing location planning under uncertainty. Socio-Econom. Planning Sci. (2001) 35(3):149–173Crossref, Google Scholar
• Johnson M. P. Single-period location models for subsidized housing: Tenant-based subsidies. Ann. Oper. Res. (2003) 123(2):105–124Crossref, Google Scholar
• Kaplan E. H. Managing the demand for public housing. (1984) . Technical Report 183, MIT Operations Research Center, Cambridge, MAGoogle Scholar
• Kaplan E. H. How PHA's fill their units. J. Housing (1985) 42(1):13–20Google Scholar
• Kaplan E. H. Tenant assignment models. Oper. Res. (1986) 34(6):832–843Link, Google Scholar
• Kaplan E. H. A public housing queue with reneging and task-specific servers. Decision Sci. (1988) 19(2):383–391Crossref, Google Scholar
• Kaplan E. H. Personal communication. (2006) Google Scholar
• Khintchine A. Y.Mathematical Methods in the Theory of Queueing (1960) (Charles Griffin & Co. Limited, London) Google Scholar
• Whitt W. Departures from a queue with many busy servers. Math. Oper. Res. (1984) 9(4):534–544Link, Google Scholar
• Whitt W.Stochastic-Process Limits (2002) (Springer-Verlag, New York) Crossref, Google Scholar
• Whitt W. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. (2004) 50(10):1449–1461Link, Google Scholar
• Whitt W. Fluid models with multiserver queues with abandonments. Oper. Res. (2006a) 54(1):37–54Link, Google Scholar
• Whitt W. A multi-class fluid model for a contact center with skill-based routing. Internat. J. Electronics Comm. (2006b) 60(2):95–102Crossref, Google Scholar