On essential information in sequential decision processes

Mathematical Methods of Operations Research

Volumn 62, Issue 3, 2005, Pages 399-410

  Feinberg, Eugene A ^a  

^a Stony Brook University   (United States)

Author keywords

Average cost criterion; D policy; M X G 1 queue; Removable server

Indexed keywords

MARKOV PROCESSES; RANDOM PROCESSES;

AVERAGE COST CRITERION; D-POLICY; REMOVABLE SERVER;

DECISION THEORY;

EID: 28544445999     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-005-0035-3     Document Type: Conference Paper

References (21)

1. Balachandran KR (1973) Control policies for a single server system. Manage Sci 19:1013-1018
2. Bertesekas DP (2001) Dynamic programming and optimal control, 2nd edin. Scientific, Belmont, MA
3. Bertsekas DP, Shreve SE (1978) Stochastic optimal control: The discrete-time case, Academic, New York (republished by Athena Scientific, Belmont, MA 1997)
4. Cassandras CG (1993) Discrete event systems: modeling and performance analysis. IRWIN, Boston
5. Dynkin EB, Yushkevich AA (1979) Controlled Markov processes. Springer, Berlin Heidelberg New York
6. Fan-Orzechowski X, Feinberg EA (2004) Optimality of Randomized trunk reservation for a problem with a single constraint. Department of Applied Mathematics and Statistics, SUNY at Stony Brook, http://www.ams.sunysb.edu/ ~feinberg/public/FanFeinbergl.pdf
7. Feinberg EA (2004) Continuous-time discounted jump-Markov decision processes: a discreteevent approach. Math Oper Res 29:492-524
8. Feinberg EA, Kella O (2002) Optimality of D-policies for an M/G/1 queue. Queueing Syst 42:355-376
9. Feinberg EA, Reiman MI (1994) Optimality of randomized trunk reservation. Prob Eng Informa Sci 8:463-489
10. Feinberg EA, Shwartz A (eds) (2002) Handbook of Markov decision processes. Kluwer, Boston
11. Fristedt B, Gray L (1997) A modern approach to probability theory. Birkhäuser, Boston
12. Gut A (1988) Stopped random walks. Limit theorems and applications. Springer, Berlin Heidelberg New York
13. Hinderer K (1970) Foundations of non-stationary dynamic programming with discrete time paramerter. Springer, Berlin Heidelberg New York
14. Hordijk A (1974) Dynamic programming and Markov potential theory. Mathematical centre tracts 51, Amsterdam
15. Kitayev MY (1985) Semi-Markov and jump Markov controlled models: average cost criterion. SIAM Theory Probab. Appl. 30:272-288.
16. Kitayev MY Rykov VV (1995) Controlled queueing systems, CRC, New York
17. Koole G (2005) Routing to parallel homogeneous queues. Math Methods Oper Res, (this issue)
18. Lippman SA (1975) Applying a new device in the optimization of exponential queueing systems. Oper Res 23:687-710
19. Miller BL (1969) A queueing reward system with several customer classes. Manage Sci 16:235-245
20. Puterman ML (1994) Markov decision processes. Wiley, New York
21. Sennott LI (1999) Stochastic dynamic programming and the control of queueing systems. Wiley, New York