메뉴 건너뛰기




Volumn 53, Issue 2, 2001, Pages 265-277

A multiobjective control approach to priority queues

Author keywords

Constrained Markov control problems; C rule; Lexicographic optimality; Multiobjective control problems; Pareto optimality; Priority assignment in multi class queueing systems

Indexed keywords


EID: 0342902144     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00003995     Document Type: Article
Times cited : (4)

References (25)
  • 2
    • 0022112185 scopus 로고
    • K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal
    • Baras JS, Ma D-J, Makowski AM (1985) K competing queues with geometric service requirements and linear costs: the μc-rule is always optimal. Syst. Control Lett. 6:173-180
    • (1985) Syst. Control Lett. , vol.6 , pp. 173-180
    • Baras, J.S.1    Ma, D.-J.2    Makowski, A.M.3
  • 4
    • 85037407838 scopus 로고
    • Adaptive policies for priority assignment in discrete time queues - Discounted cost criterion
    • Cavazos-Cadena R, Hernández-Lerma O (1990) Adaptive policies for priority assignment in discrete time queues - discounted cost criterion. Control and Cyber. 19:149-177
    • (1990) Control and Cyber. , vol.19 , pp. 149-177
    • Cavazos-Cadena, R.1    Hernández-Lerma, O.2
  • 5
    • 0033099473 scopus 로고    scopus 로고
    • Constrained dynamic programming with two discount factors: Applications and an algorithm
    • Feinberg E, Shwartz A (1999) Constrained dynamic programming with two discount factors: applications and an algorithm. IEEE Trans. Autom. Control 44:628-631
    • (1999) IEEE Trans. Autom. Control , vol.44 , pp. 628-631
    • Feinberg, E.1    Shwartz, A.2
  • 7
    • 0025463530 scopus 로고
    • Markov decision processes with multiple costs
    • Ghosh MK (1990) Markov decision processes with multiple costs, Oper. Res. Lett. 9:257-260
    • (1990) Oper. Res. Lett. , vol.9 , pp. 257-260
    • Ghosh, M.K.1
  • 9
    • 0016483099 scopus 로고
    • Dynamic scheduling of a multiclass queue: Discount optimality
    • Harrison JM (1975) Dynamic scheduling of a multiclass queue: discount optimality. Oper. Res. 23:270-282
    • (1975) Oper. Res. , vol.23 , pp. 270-282
    • Harrison, J.M.1
  • 10
    • 0000636736 scopus 로고    scopus 로고
    • Constrained Markov control processes in Borel spaces: The discounted case
    • Hernández-Lerma O, González-Hernández J (2000) Constrained Markov control processes in Borel spaces: the discounted case. Math. Meth. Oper. Res. 52:271-285
    • (2000) Math. Meth. Oper. Res. , vol.52 , pp. 271-285
    • Hernández-Lerma, O.1    González-Hernández, J.2
  • 13
    • 23544455424 scopus 로고
    • Optimal adaptive control of priority assignment in queueing systems
    • Hernández-Lerma O, Marcus SI (1984) Optimal adaptive control of priority assignment in queueing systems. Syst. Control Lett. 4:65-72
    • (1984) Syst. Control Lett. , vol.4 , pp. 65-72
    • Hernández-Lerma, O.1    Marcus, S.I.2
  • 15
    • 18544392871 scopus 로고    scopus 로고
    • Sample-path optimality and variance-minimization of average cost Markov control processes
    • Hernández-Lerma O, Vega-Amaya O, Carrasco G (1999) Sample-path optimality and variance-minimization of average cost Markov control processes. SIAM J. Control Optim. 38:79-93
    • (1999) SIAM J. Control Optim. , vol.38 , pp. 79-93
    • Hernández-Lerma, O.1    Vega-Amaya, O.2    Carrasco, G.3
  • 17
    • 0000296818 scopus 로고    scopus 로고
    • Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards
    • Hordijk A, Yushkevich AA (1999) Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards. Math. Meth. Oper. Res. 50:421-448
    • (1999) Math. Meth. Oper. Res. , vol.50 , pp. 421-448
    • Hordijk, A.1    Yushkevich, A.A.2
  • 19
    • 0019621841 scopus 로고
    • Priority assignment using dynamic programming for a class of queueing systems
    • Pattipati KR, Kleinman D (1981) Priority assignment using dynamic programming for a class of queueing systems. IEEE Trans. Autom. Control 26:1095-1106
    • (1981) IEEE Trans. Autom. Control , vol.26 , pp. 1095-1106
    • Pattipati, K.R.1    Kleinman, D.2
  • 21
    • 0342461916 scopus 로고    scopus 로고
    • Controlled random sequences: Methods of convex analysis and problems with functional constraints
    • Piunovskii AB (1998) Controlled random sequences: methods of convex analysis and problems with functional constraints. Russian Math. Surveys 53 #6:1233-1293
    • (1998) Russian Math. Surveys , vol.53 , Issue.6 , pp. 1233-1293
    • Piunovskii, A.B.1
  • 23
    • 84974288946 scopus 로고
    • Constrained discounted Markov decision chains
    • Sennott LI (1991) Constrained discounted Markov decision chains. Prob. Eng. Inform. Sci. 5:463-475
    • (1991) Prob. Eng. Inform. Sci. , vol.5 , pp. 463-475
    • Sennott, L.I.1
  • 24
    • 0032384926 scopus 로고    scopus 로고
    • Discounted cost Markov decision processes with a constraint
    • Wakuta K (1998) Discounted cost Markov decision processes with a constraint. Prob. Eng. Inform. Sci. 12:177-187
    • (1998) Prob. Eng. Inform. Sci. , vol.12 , pp. 177-187
    • Wakuta, K.1


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