Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Asymptotically optimal index policies for an abandonment queue with convex holding cost

16 references·2 citing·30 second hop

FromToDepth

this work references cited by second hop

References

1988Restless bandits: activity allocation in a changing world1,174 cited
1990Multi-Armed Bandit Allocation Indices.997 cited
1995On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models886 cited
2011Multi‐Armed Bandit Allocation Indices685 cited
1990On an index policy for restless bandits486 cited
2010Analysis and Synthesis of Computer Systems467 cited
2004Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule326 cited
1995Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ Rule277 cited
1985The c μ rule revisited236 cited
2007Dynamic priority allocation via restless bandit marginal productivity indices136 cited
2010The cμ/θ Rule for Many-Server Queues with Abandonment131 cited
2003Whittle's index policy for a multi-class queueing system with convex holding costs109 cited
2016Asymptotically optimal priority policies for indexable and nonindexable restless bandits92 cited
1995Fluid Models of Sequencing Problems in Open Queueing Networks; an Optimal Control Approach90 cited
2008SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS

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

84 cited

2010Dynamic control of a single-server system with abandonments58 cited

Cited by

2022Whittle index based Q-learning for restless bandits with average reward48 cited
2016Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems37 cited