On the structure of value functions for threshold policies in queueing models
From MaRDI portal
Recommendations
- Threshold properties of the \(M/M/1\) queue under T-policy with applications
- Extension of the optimality of the threshold policy in heterogeneous multiserver queueing systems
- Value function approximation in complex queueing systems
- scientific article; zbMATH DE number 934839
- A simple proof of the optimality of a threshold policy in a two-server queueing system
- The \(N\) threshold policy for the \(GI/M/1\) queue
- Optimality of threshold policies in single-server queueing systems with server vacations
- Threshold N-policy for M^X/H₂/1 queueing system with un-reliable server and vacations
Cites work
- A survey of Markov decision models for control of networks of queues
- scientific article; zbMATH DE number 4076264 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- On deviation matrices for birth-death processes
- On the value function of a priority queue with an application to a controlled polling model
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
Cited in
(17)- Approximate receding horizon approach for Markov decision processes: average reward case
- Threshold properties of the \(M/M/1\) queue under T-policy with applications
- On the scheduling of operations in a chat contact center
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Dispatching fire trucks under stochastic driving times
- Waiting time based routing policies to parallel queues with percentiles objectives
- On the optimal control of a two-queue polling model
- A general model of the \(M^{\theta}/G/l/m\) queueing system with threshold strategy of functioning
- On the value function of the M/Cox(r)/1 queue
- On the control of a queueing system with aging state information
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Value function approximation in complex queueing systems
- Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials
This page was built for publication: On the structure of value functions for threshold policies in queueing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462692)
