Optimal Operating Policies for the Finite-Source Queuing Process
暂无分享,去创建一个
This paper evaluates the queue-length distribution, the busy-period density and other characteristics of the finite-source queuing process in which the server remains idle until a queue of n units is built up. It also determines values of n that optimize the net profits for discounted, as well as undiscounted, infinite-horizon models.
[1] Matthew J. Sobel,et al. Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..
[2] H. Mine,et al. Linear programming algorithms for semi-Markovian decision processes , 1968 .
[3] Daniel P. Heyman,et al. Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..
[4] N. K. Jaiswal,et al. Priority queues , 1968 .