Branching bandits and Klimov's problem: achievable region and side constraints
暂无分享,去创建一个
[1] G. Klimov. Time-Sharing Service Systems. I , 1975 .
[2] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[3] Keith W. Ross,et al. Optimal priority assignment with hard constraint , 1986 .
[4] Gideon Weiss,et al. Branching Bandit Processes , 1988, Probability in the Engineering and Informational Sciences.
[5] Awi Federgruen,et al. Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..
[6] J. Walrand,et al. Interchange arguments in stochastic scheduling , 1989 .
[7] John N. Tsitsiklis,et al. Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .
[8] David D. Yao,et al. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..
[9] Armand M. Makowski,et al. On constrained optimization of the Klimov network and related Markov decision processes , 1993, IEEE Trans. Autom. Control..
[10] Ioannis Ch. Paschalidis. Scheduling of multiclass queueing networks : bounds on achievable performance , 1993 .
[11] P. R. Kumar,et al. Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..