On the optimization of two-class work-conserving parameterized scheduling policies
DOI10.1007/S10288-016-0312-4zbMATH Open1350.60097OpenAlexW2330113505MaRDI QIDQ330110FDOQ330110
Authors: Jasper Vanlerberghe, Tom Maertens, Joris Walraevens, Stijn De Vuyst, Herwig Bruneel 
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
Recommendations
- Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Optimal scheduling of parallel queues using stochastic flow models
- The single-server scheduling problem with convex costs
- Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Existence of optimal solutions to problems involving randomness (49J55)
Cites Work
- Title not available (Why is that?)
- Stochastic simulation: Algorithms and analysis
- Introduction to Stochastic Search and Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Title not available (Why is that?)
- 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
- The Achievable Region Approach to the Optimal Control of Stochastic Systems
- Title not available (Why is that?)
- Monotonicity properties for multi-class queueing systems
- 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
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
- A Discrete-Time Priority Queue with Train Arrivals
- Queueing models with multiple waiting lines
- Power series approximations for two-class generalized processor sharing systems
- Interacting queues in heavy traffic
Cited In (5)
- Price-coupled scheduling for differentiated services: Gcµversus GPS
- Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals
- Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline
- Strict monotonicity and continuity of mean unfinished work in two queues sharing a server
- Analysis of a two-queue discrete-time model with random alternating service under high occupancy in one queue
Uses Software
This page was built for publication: On the optimization of two-class work-conserving parameterized scheduling policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330110)
