Optimal priority assignment: a time sharing approach

DOI10.1109/9.35286zbMath0694.90053OpenAlexW1979870779WikidataQ59313631 ScholiaQ59313631MaRDI QIDQ3470236

Adam Shwartz, Eitan Altman

Publication date: 1989

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

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

zbMATH Keywords

infinite capacity discrete-time queuesJobs of several typestime sharing policies

Mathematics Subject Classification ID

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

Related Items (4)

Asymptotic properties of constrained Markov Decision Processes ⋮ Stochastic approximations for finite-state Markov chains ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space

This page was built for publication: Optimal priority assignment: a time sharing approach