Some thoughts on an \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue
A formerly presented \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue is extended for solving the problems with the average reward criterion and with a general action space.
scientific article; zbMATH DE number 4066594
scientific article