Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule

DOI10.1007/3-540-63397-9_18MaRDI QIDQ826091zbMATH OpenOpenAlexFDO

Authors José Niño-Mora, Kevin D. Glazebrook

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_18

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
• An analysis of Klimov's problem with parallel servers
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Conservation laws for single-server fluid networks

Cited in

(4)

• Conservation laws for single-server fluid networks
• Process Scheduling in a Computer System
• Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
• On Klimov's model by two job classes and exponential processing times

This page was built for publication: Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule

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