Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems

16 references·0 citing·35 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
2011Multi‐Armed Bandit Allocation Indices685 cited
1990On an index policy for restless bandits486 cited
1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
1985The c μ rule revisited236 cited
2001Dynamic Control of a Queue with Adjustable Service Rate220 cited
1996Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points140 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
2009Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations45 cited
2015Asymptotically optimal index policies for an abandonment queue with convex holding cost

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

23 cited

2014Index policies for a multi-class queue with convex holding cost and abandonments22 cited

Cited by

No citing works inside the corpus for this window.