Page 311 - A First Course In Stochastic Models

REFERENCES 305

REFERENCES
Cidon, I., Georgiadis, L., G´ uerin, R. and Khamisy, A. (1995) Optimal buffer sharing. IEEE
J. Selected Areas in Commun., 13, 1229–1240.
Cooper, W.L., Henderson, S.G. and Lewis, M.E. (2003) Convergence of simulation-based
policy iteration. Prob. Engng and Inform. Sci., 17, 000–000.
De Cani, J.S. (1964) A dynamic programming algorithm for embedded Markov chains when
the planning horizon is at infinity. Management Sci., 10, 716–733.
De Leve, G., Federgruen, A. and Tijms, H.C. (1977) A general Markov decision method, I:
model and method, II: applications. Adv. Appl. Prob., 9, 296–335.
Howard, R.A. (1964) Research in semi-Markovian decision structures. J. Operat. Res. Soc.
Japan, 6, 163–199.
Jewell, W.S. (1963) Markov renewal programming: I and II. Operat. Res., 11, 938–971.
Krishnan, K.R. and Ott, T.J. (1986) State-dependent routing for telephone traffic: theory
and results. In: Proce 25th IEEE Conference on Decision and Control, Athens, Greece,
pp. 2124–2128 IEEE, New York.
Krishnan, K.R. and Ott, T.J. (1987) Joining the right queue: a Markov decision rule. In:
Proce 26th IEEE Conference on Decision and Control, Los Angeles, pp. 1863–1868
IEEE, New York.
Lippman, S.A. (1975) Applying a new device in the optimization of exponential queueing
systems. Operat. Res., 23, 687–710.
Nobel, R.D. and Tijms, H.C. (2000) Optimal control of a queueing system with heteroge-
neous servers and setup costs. IEEE Trans. Automat. Contr., 45, 780–784.
Norman, J.M. (1972) Heuristic Procedures in Dynamic Programming. Manchester University
Press, Manchester.
Sassen, S.A.E., Tijms, H.C. and Nobel, R.D. (1997) A heuristic rule for routing customers
to parallel servers. Statistica Neerlandica, 51, 107–121.
Schweitzer, P.J. (1965) Perturbation Theory and Markovian Decision Processes. PhD dis-
sertation, Massachusetts Institute of Technology.
Schweitzer, P.J. (1971) Iterative solution of the functional equations of undiscounted Markov
renewal programming. J. Math. Anal. Appl., 34, 495–501.
Schweitzer, P.J. and Seidman, A. (1985) Generalized polynomial approximations in Marko-
vian decision processes. J. Math. Anal. Appl., 110, 568–582.
Seidman, A. and Schweitzer, P.J. (1984) Part selection policy of a flexible manufacturing
cell feeding several production lines. AIEE Trans., 16, 355–362.
Tijms, H.C. (1980) An algorithm for average cost denumerable state semi-Markov decision
problems with applications to controlled production and queueing systems. In: Recent
Developments in Markov Decision Processes, edited by R. Hartley, L.C. Thomas and
D.J. White, pp. 143–179, Academic Press, New York.
Tijms, H.C. and Eikeboom, A.M. (1986) A simple technique in Markovian control with
applications to resource allocation in communication networks. Operat. Res. Lett., 5,
25–32.
Wijngaard, J. (1979) Decomposition for dynamic programming in production and inventory
control. Engng and Process Econom., 4, 385–388.