Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Heavy-Traffic Limits for Queues with Many Exponential Servers

1 references·16 citing·34 second hop

FromToDepth

this work references cited by second hop

References

1993An introduction to queueing theory906 cited

Cited by

2007The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research747 cited
2002Designing a Call Center with Impatient Customers576 cited
1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods544 cited
1993APPROXIMATIONS FOR THE GI/G/m QUEUE408 cited
2004Dimensioning Large Call Centers342 cited
2002Queueing Models of Call Centers: An Introduction323 cited
2007Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System299 cited
2005Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue275 cited
1998Strong approximations for Markovian service networks254 cited
2005A Staffing Algorithm for Call Centers with Skill-Based Routing251 cited
1996Server Staffing to Meet Time-Varying Demand226 cited
1989Planning Queueing Simulations203 cited
2008Staffing of Time-Varying Queues to Achieve Time-Stable Performance194 cited
2004On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

190 cited

2007Martingale proofs of many-server heavy-traffic limits for Markovian queues183 cited

1992Understanding the Efficiency of Multi-Server Service Systems180 cited