The single-server scheduling problem with convex costs
From MaRDI portal
Publication:1945446
DOI10.1007/s11134-012-9316-8zbMath1263.90022OpenAlexW2096767949MaRDI QIDQ1945446
Publication date: 8 April 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-012-9316-8
Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items
On the optimization of two-class work-conserving parameterized scheduling policies ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost
Cites Work
- Unnamed Item
- Dynamic control of a single-server system with abandonments
- On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- The cμ rule revisited
- Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
- Stochastic Scheduling with Release Dates and Due Dates
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Time-Sharing Service Systems. I
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Maximum Pressure Policies in Stochastic Processing Networks
This page was built for publication: The single-server scheduling problem with convex costs
