Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server

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

This paper studies the optimal operation of an M/G/1 queuing system with removable server and the following cost structure: a holding cost per customer in the system per unit time, a cost per unit time of keeping the server running, and fixed charges for turning the server on or off. The server can be turned on at arrival epochs or off at service-completion epochs. The paper characterizes an optimal policy for the infinite-horizon discounted problem, offers an optimality proof, and presents a computational algorithm.

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.