All Stories

  1. A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits

    Article • Mathematics of Operations Research, October 2019, INFORMS

    Professor José Niño-Mora

  2. Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization

    Article • Computers & Operations Research, March 2019, Elsevier

    Professor José Niño-Mora

  3. Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections

    Article • January 2016, Springer Science + Business Media

    Professor José Niño-Mora

  4. A Dynamic Page-Refresh Index Policy for Web Crawlers

    Article • January 2014, Springer Science + Business Media

    Professor José Niño-Mora

  5. Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies

    Article • Computers & Operations Research, December 2012, Elsevier

    Professor José Niño-Mora

  6. Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies

    Article • European Journal of Operational Research, August 2012, Elsevier

    Professor José Niño-Mora

  7. Index-Based Admission Control and Load Balancing of Firm Real-Time Jobs in Multi-clusters

    Article • September 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  8. Computing a Classic Index for Finite-Horizon Bandits

    Article • INFORMS Journal on Computing, May 2011, INFORMS

    Professor José Niño-Mora

  9. Klimov's Model

    Article • January 2011, Wiley

    Professor José Niño-Mora

  10. Conservation Laws and Related Applications

    Article • January 2011, Wiley

    Professor José Niño-Mora

  11. Index policies for admission and routing of soft real-time traffic to parallel queues

    Article • ACM SIGMETRICS Performance Evaluation Review, October 2010, ACM (Association for Computing Machinery)

    Professor José Niño-Mora

  12. Multitarget tracking via restless bandit marginal productivity indices and Kalman filter in discrete time

    Article • December 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  13. A Restless Bandit Marginal Productivity Index for Opportunistic Spectrum Access with Sensing Errors

    Article • January 2009, Springer Science + Business Media

    Professor José Niño-Mora

  14. A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs

    Article • INFORMS Journal on Computing, May 2008, INFORMS

    Professor José Niño-Mora

  15. An Index Policy for Dynamic Fading-Channel Allocation to Heterogeneous Mobile Users with Partial Observations

    Article • April 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  16. Computing an Index Policy for Multiarmed Bandits with Deadlines

    Article • January 2008, Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST)

    Professor José Niño-Mora

  17. An Index Policy for Multiarmed Multimode Restless Bandits

    Article • January 2008, Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST)

    Professor José Niño-Mora

  18. Admission Control and Routing to Parallel Queues with Delayed Information via Marginal Productivity Indices

    Article • January 2008, Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST)

    Professor José Niño-Mora, Peter Jacko

  19. A (2/3)n3Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain

    Article • INFORMS Journal on Computing, November 2007, INFORMS

    Professor José Niño-Mora

  20. Dynamic priority allocation via restless bandit marginal productivity indices

    Article • Top, September 2007, Springer Science + Business Media

    Professor José Niño-Mora

  21. Rejoinder on: Dynamic priority allocation via restless bandit marginal productivity indices

    Article • Top, September 2007, Springer Science + Business Media

    Professor José Niño-Mora

  22. Marginal Productivity Index Policies for Scheduling Multiclass Delay-/Loss-Sensitive Traffic with Delayed State Observation

    Article • May 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  23. Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)

    Article • Electronic Notes in Discrete Mathematics, March 2007, Elsevier

    Professor José Niño-Mora, Peter Jacko

  24. Computing an Index Policy for Bandits with Switching Penalties

    Article • January 2007, Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST)

    Professor José Niño-Mora

  25. Characterization and Computation of Restless Bandit Marginal Productivity Indices

    Article • January 2007, Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST)

    Professor José Niño-Mora

  26. Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue

    Article • Queueing Systems, December 2006, Springer Science + Business Media

    Professor José Niño-Mora

  27. Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-StockM/G/1Queues

    Article • Mathematics of Operations Research, February 2006, INFORMS

    Professor José Niño-Mora

  28. Marginal productivity index policies for scheduling multiclass delay-/loss-sensitive traffic

    Article • January 2005, Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  29. Whittle's index policy for a multi-class queueing system with convex holding costs

    Article • Mathematical Methods of Operations Research, April 2003, Springer Science + Business Media

    Professor José Niño-Mora

  30. Index policies for a class of discounted restless bandits

    Article • December 2002, Cambridge University Press

    Professor José Niño-Mora

  31. Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach

    Article • Mathematical Programming, December 2002, Springer Science + Business Media

    Professor José Niño-Mora

  32. Parallel Scheduling of MulticlassM/M/mQueues: Approximate and Heavy-Traffic Optimization of Achievable Performance

    Article • Operations Research, August 2001, INFORMS

    Professor José Niño-Mora

  33. Restless bandits, partial conservation laws and indexability

    Article • March 2001, Cambridge University Press

    Professor José Niño-Mora

  34. Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

    Article • September 2000, Cambridge University Press

    Professor José Niño-Mora

  35. Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

    Article • Journal of Applied Probability, September 2000, Cambridge University Press

    Professor José Niño-Mora

  36. Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic

    Article • Operations Research, February 2000, INFORMS

    Professor José Niño-Mora

  37. The achievable region approach to the optimal control of stochastic systems

    Article • Journal of the Royal Statistical Society Series B Statistical Methodology, November 1999, Wiley

    Professor José Niño-Mora

  38. A Semidefinite Programming Approach to the Optimal Control of a Single Server Queueing System with Imposed Second Moment Constraints

    Article • Journal of the Operational Research Society, July 1999, JSTOR

    Professor José Niño-Mora

  39. A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints

    Article • Journal of the Operational Research Society, July 1999, Taylor & Francis

    Professor José Niño-Mora

  40. Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case

    Article • Mathematics of Operations Research, May 1999, INFORMS

    Professor José Niño-Mora

  41. Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case

    Article • Mathematics of Operations Research, May 1999, INFORMS

    Professor José Niño-Mora

  42. Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule

    Article • January 1997, Springer Science + Business Media

    Professor José Niño-Mora

  43. Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems

    Article • Mathematics of Operations Research, May 1996, INFORMS

    Professor José Niño-Mora

  44. Stochastic Scheduling

    Article • Springer Science + Business Media

    Professor José Niño-Mora

  45. Stochastic Scheduling

    Article • Springer Science + Business Media

    Professor José Niño-Mora

  46. A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups

    Article • Springer Science + Business Media

    Professor José Niño-Mora

  47. A Marginal Productivity Index Policy for the Finite-Horizon Multiarmed Bandit Problem

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  48. Marginal productivity index policies for scheduling multiclass wireless transmissions

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Professor José Niño-Mora

  49. Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging

    Article • Springer Science + Business Media

    Professor José Niño-Mora