Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals
暂无分享,去创建一个
[1] D. Blackwell. Discounted Dynamic Programming , 1965 .
[2] Colin E. Bell,et al. Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server , 1971, Oper. Res..
[3] Uri Yechiali,et al. On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process , 1971, Oper. Res..
[4] U. Yechiali. Customers' Optimal Joining Rules for the GI/M/s Queue , 1972 .
[5] Manfred SchÄl,et al. Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal , 1975 .
[6] Sagi N. Raju,et al. Recursive Relations in the computation of the Equilibrium Results of Finite Queues. , 1976 .
[7] Michael J. Magazine,et al. A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..
[8] Shaler Stidham,et al. Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue , 1978 .
[9] Howard J. Weiss. The Computation of Optimal Control Limits for a Queue with Batch Services , 1979 .
[10] S. Stidham,et al. Control of arrivals to a stochastic input–output system , 1980, Advances in Applied Probability.
[11] Hans-Joachim Langen. Applying the method of phases in the optimization of queuing systems , 1982, Advances in Applied Probability.