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

DOI10.1016/0167-6377(88)90070-3zbMath0653.90022OpenAlexW2001064273MaRDI QIDQ1108181

Norihiro Mizuno

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90070-3

zbMATH Keywords

Markov decision processesaverage reward criterionGI/M/1/N queuegeneral action spaceoptimal control of arrivals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Cites Work

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

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