Priority assignment using dynamic programming for a class of queueing systems

DOI10.1109/TAC.1981.1102792zbMath0466.90029OpenAlexW1979374498MaRDI QIDQ3919429

David L. Kleinman, Krishna R. Pattipati

Publication date: 1981

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

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

zbMATH Keywords

Bellman's optimality principlepriority assignmentheavy traffic approximationscomputation of optimal policysingle server priority queueing systemsuboptimal threshold policysupervisory control system

Mathematics Subject Classification ID

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

Related Items (2)

Sensitivity analysis of machine interference in manufacturing systems ⋮ Optimal adaptive control of priority assignment in queueing systems

This page was built for publication: Priority assignment using dynamic programming for a class of queueing systems