Author:
Kijima Masaaki,Tamura Akihisa
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bessler, S.A. and Veinott, A.F. (1966), “Optimal policy for a dynamic multi-echelon inventory model,” Naval Research Logistics Quarterly
13, 355–389.
2. Buyukkoc, C., Varaiya, P. and Walrand, J. (1985), “The cμ rule revisited,” Advances in Applied Probability
17, 237–238.
3. Gittins, J.C. (1979), “Bandit processes and dynamic allocation indices,” Journal of the Royal Statistical Society
41, 148–177.
4. Hirayama, T., Kijima, M. and Nishimura, S. (1989), “Further results for dynamic scheduling of multiclass G/G/1 queues,” Journal of Applied Probability
26, 595–603.
5. Ishii, H. and Nishida, T. (1983), “Stochastic bottleneck spanning tree problem,” Networks
13, 443–449.