![]() | ![]() |
2009 | ||
---|---|---|
11 | EE | José Niño-Mora: Stochastic Scheduling. Encyclopedia of Optimization 2009: 3818-3824 |
2008 | ||
10 | EE | José Niño-Mora: A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups. NET-COOP 2008: 78-86 |
9 | EE | José Niño-Mora: A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs. INFORMS Journal on Computing 20(2): 255-269 (2008) |
2007 | ||
8 | EE | José Niño-Mora: Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging. NET-COOP 2007: 138-149 |
7 | EE | José Niño-Mora: Characterization and computation of restless bandit marginal productivity indices. VALUETOOLS 2007: 74 |
6 | EE | José Niño-Mora: Computing an index policy for bandits with switching penalties. VALUETOOLS 2007: 76 |
5 | EE | Peter Jacko, José Niño-Mora: Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract). Electronic Notes in Discrete Mathematics 28: 145-152 (2007) |
2006 | ||
4 | EE | José Niño-Mora: Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue. Queueing Syst. 54(4): 281-312 (2006) |
2005 | ||
3 | EE | José Niño-Mora: Marginal productivity index policies for scheduling restless bandits with switching penalties. Algorithms for Optimization with Incomplete Information 2005 |
1997 | ||
2 | Kevin D. Glazebrook, José Niño-Mora: Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. ESA 1997: 232-245 | |
1993 | ||
1 | Dimitris Bertsimas, José Niño-Mora: Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. IPCO 1993: 355-384 |
1 | Dimitris Bertsimas | [1] |
2 | Kevin D. Glazebrook | [2] |
3 | Peter Jacko | [5] |