Priority assignment using dynamic programming for a class of queueing systems

DOI10.1109/TAC.1981.1102792MaRDI QIDQ3919429zbMATH OpenOpenAlexFDO

Authors 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 principlecomputation of optimal policyheavy traffic approximationspriority assignmentsingle server priority queueing systemsuboptimal threshold policysupervisory control system

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919429)