On the optimization of two-class work-conserving parameterized scheduling policies

DOI10.1007/s10288-016-0312-4zbMath1350.60097OpenAlexW2330113505MaRDI QIDQ330110

Herwig Bruneel, Tom Maertens, Stijn De Vuyst, Jasper Vanlerberghe, Joris Walraevens

Publication date: 24 October 2016

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-016-0312-4

zbMATH Keywords

optimizationschedulingqueueing systemsgeneralized processor sharingstrict priority

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (3)

Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals ⋮ Strict monotonicity and continuity of mean unfinished work in two queues sharing a server ⋮ Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
• Power series approximations for two-class generalized processor sharing systems
• Monotonicity properties for multi-class queueing systems
• Interacting queues in heavy traffic
• Discrete-time queues with discretionary priorities
• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline
• The single-server scheduling problem with convex costs
• A semi-preemptive priority scheduling discipline: performance analysis
• Analysis of a discrete-time preemptive resume priority buffer
• Generalized processor sharing: Characterization of the admissible region and selection of optimal weights
• Stochastic simulation: Algorithms and analysis
• The cμ rule revisited
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• Introduction to Stochastic Search and Optimization
• The Achievable Region Approach to the Optimal Control of Stochastic Systems
• A Discrete-Time Priority Queue with Train Arrivals
• Queueing models with multiple waiting lines

This page was built for publication: On the optimization of two-class work-conserving parameterized scheduling policies