Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
DOI10.1287/OPRE.1080.0632zbMATH Open1226.90129OpenAlexW2119217665MaRDI QIDQ3100402FDOQ3100402
Authors:
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/8373001/Index_policies.pdf
Recommendations
- Routing and staffing in large-scale service systems: the case of homogeneous impatient customers and heterogeneous servers
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
- Optimal routing into two heterogeneous service stations with delayed information
- Optimal control of an \(M/H_k/1\) queueing system with impatient customer and \(N\)-Policy
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Benchmark policies for utility-carrying queues with impatience
- Dynamized routing policies for minimizing expected waiting time in a multi-class multi-server system
- Optimal admission and routing with congestion-sensitive customer classes
- Strategic behavior of customers and optimal control for batch service polling systems with priorities
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
dynamic programmingadmission controlMarkov decision processesroutingcustomer impatiencerestless banditsindex policiesmonotone policies
Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Cited In (21)
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- Whittle index based Q-learning for restless bandits with average reward
- Whittle index approach to multiserver scheduling with impatient customers and DHR service times
- Dynamic resource allocation in a multi-product make-to-stock production system
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Prioritizing hepatitis C treatment in U.S. prisons
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Index policies for the routing of background jobs
- Coupled bisection for root ordering
- Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies
- On the computation of Whittle's index for Markovian restless bandits
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- Testing indexability and computing Whittle and Gittins index in subcubic time
- Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster
- On the dynamic allocation of assets subject to failure
- On the Whittle index of Markov modulated restless bandits
- Whittle indexability in egalitarian processor sharing systems
This page was built for publication: Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100402)
