An M/M/1 Dynamic Priority Queue with Optional Promotion

DOI10.1287/OPRE.29.1.174MaRDI QIDQ3900798zbMATH OpenOpenAlexFDO

Authors Ehud Kofman, Steven A. Lippman

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.29.1.174

zbMATH Keywords

efficient algorithmexpected holding costs per priority customeroptimization of priority queueing systemspriority queue with optional promotion

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Queues and service in operations research (90B22)

Cited in

(2)

• An overview for Markov decision processes in queues and networks
• An M/M/l queue with a generalized dynamic promotion rule

This page was built for publication: An M/M/1 Dynamic Priority Queue with Optional Promotion

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