Optimal priority assignment with hard constraint

DOI10.1109/TAC.1986.1104127zbMath0625.90031OpenAlexW2165882932MaRDI QIDQ3028695

Philippe Nain, Keith W. Ross

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1109/tac.1986.1104127

zbMATH Keywords

discrete-time queueing systemequilibrium behaviourinfinite capacity queueoptimal bias factorrandomized modificationstatic-priority policy

Mathematics Subject Classification ID

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

Related Items

Asymptotic properties of constrained Markov Decision Processes, Stochastic approximations for finite-state Markov chains, Boundary value problems in queueing theory, Constrained Semi-Markov decision processes with average rewards, Unnamed Item, Recent results on conditions for the existence of average optimal stationary policies, Optimal control of variable rate coding with incomplete observation in integrated voice/data packet networks, Sensitivity of constrained Markov decision processes, Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space, An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits, Integrated optimization of the use of information and hardware resources in data processing systems with controllable message size, Optimal intensity control of a multi-class queue