Optimal dispatching to parallel heterogeneous servers in light traffic
暂无分享,去创建一个
[1] Michael N. Katehakis,et al. Allocation of distinguishable servers , 1986, Comput. Oper. Res..
[2] Steven A. Lippman,et al. Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..
[3] Michael N. Katehakis,et al. A dynamic routing problem ― Numerical procedures for light traffic conditions , 1985 .
[4] S. Lippman. Semi-Markov Decision Processes with Unbounded Rewards , 1973 .
[5] Satish K. Tripathi,et al. A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors , 1984, IEEE Transactions on Computers.
[6] Martin I. Reiman,et al. Open Queueing Systems in Light Traffic , 1989, Math. Oper. Res..
[7] P. R. Kumar,et al. Optimal control of a queueing system with two heterogeneous servers , 1984 .
[8] A. G. Pakes,et al. Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..
[9] Jean Walrand,et al. A note on optimal control of a queuing system with two heterogeneous servers , 1984 .
[10] Paul G. Marlin,et al. On the Ergodic Theory of Markov Chains , 1973, Oper. Res..
[11] Manfred SchÄl,et al. Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal , 1975 .
[12] Zvi Rosberg. Semi-Markov decision processes with polynomial reward , 1982 .