Computing Optimal Policies for Controlled Tandem Queueing Systems

Published Online:https://doi.org/10.1287/opre.35.1.121

This paper discusses the use of modified policy iteration algorithms for finding the optimal control for the service rate for a tandem queueing system that has a general cost structure. It compares several variants of the algorithms and shows that the optimal control problem can be solved within a reasonable computation time.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.