Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

The single-server scheduling problem with convex costs

15 references·1 citing·42 second hop

FromToDepth

this work references cited by second hop

References

1993Discrete event systems : modeling and performance analysis385 cited
2004Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule326 cited
1975Time-Sharing Service Systems. I285 cited
1995Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ Rule277 cited
2005Maximum Pressure Policies in Stochastic Processing Networks258 cited
1985The c μ rule revisited236 cited
1975Dynamic Scheduling of a Multiclass Queue: Discount Optimality148 cited
2004Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime125 cited
2003Whittle's index policy for a multi-class queueing system with convex holding costs109 cited
2008Asymptotic optimality of maximum pressure policies in stochastic processing networks95 cited
1985Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal84 cited
2006Asymptotic optimality of maximum pressure policies in stochastic processing networks82 cited
2010Dynamic control of a single-server system with abandonments58 cited
2010On the asymptotic optimality of the cμ/θ rule under ergodic cost50 cited
2011A nearly-optimal index rule for scheduling of users with abandonment

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

22 cited

Cited by

2016Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems37 cited