Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy

13 references·4 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1961A Proof for the Queuing Formula: L = λ W2,777 cited
1987Limit Theorems for Stochastic Processes1,319 cited
1981Heavy-Traffic Limits for Queues with Many Exponential Servers750 cited
2001A proof of the queueing formula: L=λW350 cited
2009The G/GI/N queue in the Halfin–Whitt regime146 cited
2004Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic140 cited
2010The cμ/θ Rule for Many-Server Queues with Abandonment131 cited
2010Law of large numbers limits for many-server queues113 cited
2010Fluid limits of many-server queues with reneging113 cited
2008The Skorokhod problem in a time-dependent interval82 cited
2010On many-server queues in heavy traffic53 cited
2010On the asymptotic optimality of the cμ/θ rule under ergodic cost50 cited
2016ASYMPTOTIC APPROXIMATIONS FOR STATIONARY DISTRIBUTIONS OF MANY-SERVER QUEUES WITH ABANDONMENT43 cited

Cited by

2018Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems35 cited
2019Scheduling an Overloaded Multiclass Many-Server Queue with Impatient Customers

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

34 cited

2013Fluid limits of many-server queues with abandonments, general service and continuous patience time distributions18 cited

2020An Invitation Control Policy for Proactive Service Systems: Balancing Efficiency, Value, and Service Level16 cited