Branching bandits and Klimov's problem: achievable region and side constraints
暂无分享,去创建一个
[1] G. Klimov. Time-Sharing Service Systems. I , 1975 .
[2] Erol Gelenbe,et al. Analysis and Synthesis of Computer Systems , 1980 .
[3] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[4] Keith W. Ross,et al. Optimal priority assignment with hard constraint , 1986 .
[5] D. Tompsett. Conservation laws , 1987 .
[6] J. Ben Atkinson,et al. An Introduction to Queueing Networks , 1988 .
[7] Gideon Weiss,et al. Branching Bandit Processes , 1988, Probability in the Engineering and Informational Sciences.
[8] Awi Federgruen,et al. Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..
[9] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[10] J. Walrand,et al. Interchange arguments in stochastic scheduling , 1989 .
[11] J. Bather,et al. Multi‐Armed Bandit Allocation Indices , 1990 .
[12] John N. Tsitsiklis,et al. Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .
[13] Leonidas Georgiadis,et al. Extended Polymatroids: Properties and Optimization , 1992, Conference on Integer Programming and Combinatorial Optimization.
[14] David D. Yao,et al. Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..
[15] Armand M. Makowski,et al. On constrained optimization of the Klimov network and related Markov decision processes , 1993, IEEE Trans. Autom. Control..
[16] Ioannis Ch. Paschalidis. Scheduling of multiclass queueing networks : bounds on achievable performance , 1993 .
[17] S. Sushanth Kumar,et al. Performance bounds for queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.
[18] P. R. Kumar,et al. Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..