A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue

DOI10.1016/0167-6377(86)90077-5zbMath0615.90044OpenAlexW2043503452WikidataQ115108692 ScholiaQ115108692MaRDI QIDQ1821013

Norihiro Mizuno

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90077-5

zbMATH Keywords

polynomial-time algorithmFourier-Motzkin eliminationGI/M/1/N queueing systemsoptimal admission policy

Mathematics Subject Classification ID

Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items

Some thoughts on an \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue

Cites Work

• Unnamed Item
• Unnamed Item
• Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals
• Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue
• Contraction Mappings in the Theory Underlying Dynamic Programming