Characterization and Optimization of Achievable Performance in General Queueing Systems

DOI10.1287/OPRE.36.5.733zbMath0677.60103OpenAlexW1999650389MaRDI QIDQ3833401

H. Groenevelt, Awi Federgruen

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ec4f3b5afc56dabe4e3c420169295482d6197f79

zbMATH Keywords

randomizationpreemptive priority disciplineabsolute priority rulesqueueing systems with exponential service times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (18)

On bounds of response time performance achievable by multiclass single- server queues ⋮ Invariance of workload in queueing systems ⋮ On the optimization of two-class work-conserving parameterized scheduling policies ⋮ Four proofs of Gittins' multiarmed bandit theorem ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Computational geometric approach to submodular function minimization for multiclass queueing systems ⋮ Decomposable Markov Decision Processes: A Fluid Optimization Approach ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION ⋮ The use of relative priorities in optimizing the performance of a queueing system ⋮ Dual bounds of a service level assignment problem with applications to efficient pricing ⋮ Relative priority policies for minimizing the cost of queueing systems with service discrimination ⋮ Some specially structured assemble-to-order systems ⋮ Submodular function minimization ⋮ Optimal pricing and scheduling control of product shipping ⋮ A game theoretic approach to a problem in polymatroid maximization

This page was built for publication: Characterization and Optimization of Achievable Performance in General Queueing Systems