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

DOI10.1007/S10288-016-0312-4MaRDI QIDQ330110zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimizationschedulingqueueing systemsgeneralized processor sharingstrict priority

Mathematics Subject Classification ID

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)

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

Cites work

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

Cited in

(5)

• Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline
• Analysis of a two-queue discrete-time model with random alternating service under high occupancy in one queue
• Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals
• Price-coupled scheduling for differentiated services: Gcµversus GPS
• Strict monotonicity and continuity of mean unfinished work in two queues sharing a server

Describes a project that uses

Uses Software

• BRENT

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)