Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
DOI10.1007/S11134-006-0302-XzbMATH Open1117.90035OpenAlexW3013005026MaRDI QIDQ855181FDOQ855181
Publication date: 4 January 2007
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/226
Recommendations
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Performance bounds and suboptimal policies for multi-class queue
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- On scheduling a multiclass queue with abandonments under general delay costs
- Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
- Scheduling of Multi-Class Single-Server Queues Under Nontraditional Performance Measures
- Controlling the workload of M/G/1 queues via the \(q\)-policy
SchedulingConservation lawsBias optimalityDelay-sensitiveFinite buffersIndex policiesLoss-sensitiveMulti-queue switchMulticlass queueRestless banditsWork-cost analysis
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication networks in operations research (90B18) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Restless bandits, partial conservation laws and indexability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bias Optimality in Controlled Queueing Systems
- Discrete Dynamic Programming
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality
- On the Optimality of the Generalized Shortest Queue Policy
- Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
- Title not available (Why is that?)
- Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
- Modeling and dynamic scheduling of a queueing system with blocking and starvation
- On the duality between routing and scheduling systems with finite buffer space
- Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
Cited In (7)
- Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem
- Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies
- Dynamic priority allocation via restless bandit marginal productivity indices
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
This page was built for publication: Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855181)
