Pages that link to "Item:Q1396274"
From MaRDI portal
The following pages link to Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach (Q1396274):
Displaying 29 items.
- 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)
- General notions of indexability for queueing control and asset management (Q549860) (← 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)
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization (Q1634077) (← links)
- Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies (Q1926787) (← links)
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities (Q2216197) (← links)
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing (Q2393118) (← links)
- Dynamic routing to heterogeneous collections of unreliable servers (Q2641948) (← links)
- On the computation of Whittle's index for Markovian restless bandits (Q2661759) (← links)
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract) (Q3439578) (← links)
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging (Q3614975) (← links)
- Grid Brokering for Batch Allocation Using Indexes (Q3614985) (← links)
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups (Q3616980) (← links)
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM (Q3645155) (← links)
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections (Q4571093) (← links)
- (Q4633046) (← links)
- On the optimal allocation of service to impatient tasks (Q4819435) (← 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)
- Some indexable families of restless bandit problems (Q5395354) (← links)
- Spinning plates and squad systems: policies for bi-directional restless bandits (Q5475391) (← links)
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach (Q6432072) (← links)
