Characterization and Optimization of Achievable Performance in General Queueing Systems
From MaRDI portal
Recommendations
- Performance optimization of queueing systems with perturbation realization
- Optimal design and performance modelling of M/G/1/K queueing systems
- scientific article; zbMATH DE number 1054733
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- Performance analysis of queueing networks via robust optimization
- Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
- Performance bounds for queueing networks and scheduling policies
- scientific article; zbMATH DE number 4121724
- scientific article; zbMATH DE number 1631026
Cited in
(36)- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- On bounds of response time performance achievable by multiclass single- server queues
- A characterisation of (max,+)-linear queueing systems
- Dual bounds of a service level assignment problem with applications to efficient pricing
- Optimal design and performance modelling of M/G/1/K queueing systems
- Some specially structured assemble-to-order systems
- Achieving prescribed mean waiting times in a single-server queueing system
- 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
- Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization
- Optimization problems on the performance of a nonreliable terminal system
- A game theoretic approach to a problem in polymatroid maximization
- A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION
- Decomposable Markov decision processes: A fluid optimization approach
- Invariance of workload in queueing systems
- The impact of the composition of the customer base in general queueing models
- Study of a class of partially ordered service strategies for a system of two discrete-time queues
- Realizable Performance Vectors of a Finite-Source Queue
- On the optimization of two-class work-conserving parameterized scheduling policies
- Optimization of Priority Class Queues, with a Computer Center Case Study
- Four proofs of Gittins' multiarmed bandit theorem
- Optimal priority assignment: a time sharing approach
- Performance Evaluation in a Queueing System M 2/G/1
- M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- The synthesis of service discipline in systems with limits
- Solving convex optimization with side constraints in a multi-class queue by adaptive c rule
- Optimal pricing and scheduling control of product shipping
- General notions of indexability for queueing control and asset management
- When does partial priority improve revenue?
- Coordinated referral and scheduling decisions for specialized healthcare services
- Optimization of average waiting time functions in \(GI_ n/M/1\) queueing systems
- Dynamic priority allocation via restless bandit marginal productivity indices
- The use of relative priorities in optimizing the performance of a queueing system
- Relative priority policies for minimizing the cost of queueing systems with service discrimination
- Submodular function minimization
This page was built for publication: Characterization and Optimization of Achievable Performance in General Queueing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833401)
