Performance bounds for queueing networks and scheduling policies

From MaRDI portal
Publication:4306982

DOI10.1109/9.310033zbMath0812.90049OpenAlexW2168739325MaRDI QIDQ4306982

Sunil Kumar, P. R. Kumar

Publication date: 15 May 1995

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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



Related Items

Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality., Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions, Unnamed Item, Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy, Approximate linear programming for networks: average cost bounds, Performance analysis of scheduling policies in re-entrant manufacturing systems, 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, Computational geometric approach to submodular function minimization for multiclass queueing systems, Performance bounds for stochastic timed Petri nets, Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks, A LINEAR PROGRAMMING APPROACH TO THE STEADY-STATE ANALYSIS OF REFLECTED BROWNIAN MOTION, Computing Stationary Expectations in Level-Dependent QBD Processes, Allocating work in process in a multiple-product CONWIP system with lost sales, On the performance evaluation of multi-guarded marked graphs with single-server semantics, Bounds on linear PDEs via semidefinite optimization, Validity of heavy traffic steady-state approximations in generalized Jackson networks, Coding and control for communication networks, On deciding stability of multiclass queueing networks under buffer priority scheduling policies, Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines, Performance bounds and suboptimal policies for linear stochastic control via LMIs, New linear program performance bounds for queueing networks, Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case, Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study, Approximate dynamic programming via iterated Bellman inequalities, Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling, QRF