Pages that link to "Item:Q2726718"
From MaRDI portal
The following pages link to Restless bandits, partial conservation laws and indexability (Q2726718):
Displaying 36 items.
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies (Q339718) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Dynamic resource allocation in a multi-product make-to-stock production system (Q543557) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue (Q855181) (← links)
- Dynamic priority allocation via restless bandit marginal productivity indices (Q926578) (← links)
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem (Q1007148) (← links)
- Index policies for the maintenance of a collection of machines by a set of repairmen (Q1776971) (← links)
- Efficiency in lung transplant allocation strategies (Q2044231) (← links)
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities (Q2216197) (← links)
- Optimal selection of obsolescence mitigation strategies using a restless bandit model (Q2379539) (← links)
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing (Q2393118) (← links)
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract) (Q3439578) (← links)
- Index policies for discounted bandit problems with availability constraints (Q3516395) (← links)
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging (Q3614975) (← links)
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups (Q3616980) (← links)
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections (Q4571093) (← links)
- BANDIT STRATEGIES EVALUATED IN THE CONTEXT OF CLINICAL TRIALS IN RARE LIFE-THREATENING DISEASES (Q4629422) (← links)
- (Q4633046) (← links)
- On the optimal allocation of service to impatient tasks (Q4819435) (← links)
- Monotone Policies and Indexability for Bidirectional Restless Bandits (Q4915650) (← links)
- Resource competition in virtual network embedding (Q4994071) (← links)
- A Restless Bandit Model for Resource Allocation, Competition, and Reservation (Q5031019) (← links)
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index (Q5055364) (← links)
- A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits (Q5119843) (← links)
- Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability (Q5219548) (← links)
- Sensor Scheduling for Space Object Tracking and Collision Alert (Q5326890) (← links)
- INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS (Q5358065) (← links)
- Some indexable families of restless bandit problems (Q5395354) (← links)
- Spinning plates and squad systems: policies for bi-directional restless bandits (Q5475391) (← links)
- Index policy for multiarmed bandit problem with dynamic risk measures (Q6090163) (← links)
- An exact bandit model for the risk-volatility tradeoff (Q6643162) (← links)
