메뉴 건너뛰기




Volumn 35, Issue 1, 1998, Pages 136-150

Bias optimality in controlled queueing systems

Author keywords

Admission control; Average reward; Blackwell optimality; Control limit policies; Markov decision processes; Uniformization

Indexed keywords


EID: 0032400452     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200014741     Document Type: Article
Times cited : (42)

References (13)
  • 2
    • 0000615044 scopus 로고
    • Discrete dynamic programming
    • BLACKWELL, D. (1962). Discrete dynamic programming. Ann. Math. Statist. 33, 719-726.
    • (1962) Ann. Math. Statist. , vol.33 , pp. 719-726
    • Blackwell, D.1
  • 3
    • 0012793161 scopus 로고
    • Average, sensitive and Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards
    • DEKKER, R. AND HORDIJK, A. (1988). Average, sensitive and Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. Math. Operat. Res. 13, 395-420.
    • (1988) Math. Operat. Res. , vol.13 , pp. 395-420
    • Dekker, R.1    Hordijk, A.2
  • 5
    • 38249027853 scopus 로고
    • Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision chains
    • LASSERRE, J. (1988). Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision chains. J. Math. Anal. Appl. 136, 479-490.
    • (1988) J. Math. Anal. Appl. , vol.136 , pp. 479-490
    • Lasserre, J.1
  • 6
    • 0016533472 scopus 로고
    • Applying a new device in the optimization of exponential queueing systems
    • LIPPMAN, S. (1975). Applying a new device in the optimization of exponential queueing systems. Operat. Res. 23, 687-710.
    • (1975) Operat. Res. , vol.23 , pp. 687-710
    • Lippman, S.1
  • 7
    • 0039145162 scopus 로고    scopus 로고
    • An average-reward reinforcement learning algorithm for computing bias-optimal policies
    • MAHADEVAN, S. (1996). An average-reward reinforcement learning algorithm for computing bias-optimal policies. AAAI Proc.
    • (1996) AAAI Proc.
    • Mahadevan, S.1
  • 9
    • 0039737539 scopus 로고
    • A note on computing optimal control limits for GI/M/1 queuing systems
    • PUTERMAN, M.L. AND THOMAS, L.C. (1987). A note on computing optimal control limits for GI/M/1 queuing systems. Management Sci. 33, 939-943.
    • (1987) Management Sci. , vol.33 , pp. 939-943
    • Puterman, M.L.1    Thomas, L.C.2
  • 10
    • 0008697028 scopus 로고
    • The existence of sensitive optimal policies in two multi-dimensional queueing models
    • SPIEKSMA, F. (1991). The existence of sensitive optimal policies in two multi-dimensional queueing models. Ann. Operat. Res. 28, 273-295.
    • (1991) Ann. Operat. Res. , vol.28 , pp. 273-295
    • Spieksma, F.1
  • 11
    • 0000034452 scopus 로고
    • Socially and individually optimal control of arrivals to a GI/M/1 queue
    • STIDHAM, S.S., JR. (1978). Socially and individually optimal control of arrivals to a GI/M/1 queue. Management Sci. 24, 1598-1610.
    • (1978) Management Sci. , vol.24 , pp. 1598-1610
    • Stidham S.S., Jr.1
  • 12
    • 0001473026 scopus 로고
    • On finding optimal policies in discrete dynamic programming with no discounting
    • VEINOTT, A.F., JR. (1966). On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Statist. 37, 1284-1294.
    • (1966) Ann. Math. Statist. , vol.37 , pp. 1284-1294
    • Veinott A.F., Jr.1
  • 13
    • 0040363884 scopus 로고
    • Markov decision chains
    • G.B. Dantzig and B.C. Eaves. American Mathematical Association, Providence, RI
    • VEINOTT, A.F., JR. (1974). Markov decision chains. In Studies in Optimization. ed. G.B. Dantzig and B.C. Eaves. American Mathematical Association, Providence, RI. pp. 124-159.
    • (1974) Studies in Optimization , pp. 124-159
    • Veinott A.F., Jr.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.