Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals

DOI10.1287/MNSC.29.6.725MaRDI QIDQ3670897zbMATH OpenOpenAlexFDO

Authors J. A. E. E. Van Nunen, Martin L. Puterman

Publication date 1983

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.29.6.725

zbMATH Keywords

computational resultscontrol limit policiescontrolled arrivalsGI/M/s queuepolicy iteration procedure

Mathematics Subject Classification ID

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

Cited in

(8)

• Some models of queueing control with switchover
• Lower bounding aggregation and direct computation for an infinite horizon one-reservoir model
• Optimal control for a tandem network of queues with blocking
• A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue
• Equilibrium points and equilibrium sets of some \(GI /M/1\) queues
• Optimal admission policies for a finite queue with bursty arrivals
• An overview for Markov decision processes in queues and networks
• On using discrete random models within decision support systems

This page was built for publication: Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals

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