The single-server scheduling problem with convex costs

DOI10.1007/S11134-012-9316-8MaRDI QIDQ1945446zbMATH OpenOpenAlexFDO

Authors Carlos F. Bispo

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

zbMATH Keywords

schedulingproduction controlqueuing systemsdynamic priorities\(c\mu \)-rule

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Optimal Scheduling of Multiclass Stochastic Systems
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Scheduling in a single-server queue with state-dependent service rates
• The cμ rule revisited

Cites work

• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Dynamic control of a single-server system with abandonments
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
• Maximum Pressure Policies in Stochastic Processing Networks
• On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Stochastic Scheduling with Release Dates and Due Dates
• The cμ rule revisited
• Time-Sharing Service Systems. I
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
• Whittle's index policy for a multi-class queueing system with convex holding costs

Cited in

(6)

• Scheduling in a single-server queue with state-dependent service rates
• The single-node dynamic service scheduling and dispatching problem
• Asymptotically optimal index policies for an abandonment queue with convex holding cost
• On the optimization of two-class work-conserving parameterized scheduling policies
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Whittle index approach to the multi-class queueing systems with convex holding costs and ihr service times

This page was built for publication: The single-server scheduling problem with convex costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945446)