Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
From MaRDI portal
Publication:1327604
DOI10.1214/aoap/1177005200zbMath0797.60079OpenAlexW1973022038MaRDI QIDQ1327604
Ioannis Ch. Paschalidis, John N. Tsitsiklis, Dimitris J. Bertsimas
Publication date: 10 October 1994
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005200
tightnesslinear programming problemmulticlass queueing networksscheduling policiesoptimizingachievable spacetechniques from semidefinite programming
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions, Calculation of the performance region of an easy-to-optimize alternative for generalized processor sharing, Approximate linear programming for networks: average cost bounds, Queueing Network Controls via Deep Reinforcement Learning, Asymptotically tight steady-state queue length bounds implied by drift conditions, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies, Performance evaluation of scheduling control of queueing networks: Fluid model heuristics, Computational geometric approach to submodular function minimization for multiclass queueing systems, Performance bounds for stochastic timed Petri nets, A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems, Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks, Application of direct extended modified algebraic method of Bogoyavlenskii equation on lower and upper bounds in managing and optimizing queues, An Overview for Markov Decision Processes in Queues and Networks, A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION, Exponential penalty function control of loss networks, Allocating work in process in a multiple-product CONWIP system with lost sales, Bounds on linear PDEs via semidefinite optimization, Validity of heavy traffic steady-state approximations in generalized Jackson networks, On deciding stability of multiclass queueing networks under buffer priority scheduling policies, Pseudo conservation for partially fluid, partially lossy queueing systems, New linear program performance bounds for queueing networks, The linear geodesic property is not generally preserved by a FIFO queue, Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study, Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling, QRF, Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
