On the optimal allocation of service to impatient tasks
From MaRDI portal
Publication:4819435
DOI10.1239/jap/1077134667zbMath1123.90317OpenAlexW2033459168MaRDI QIDQ4819435
R. T. Dunn, R. R. Lumley, P. S. Ansell, Kevin D. Glazebrook
Publication date: 24 September 2004
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1077134667
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (16)
A medical resource allocation model for serving emergency victims with deteriorating health conditions ⋮ A simple yet effective decision support policy for mass-casualty triage ⋮ Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE ⋮ A Bayesian approach to the triage problem with imperfect classification ⋮ Index policies for discounted bandit problems with availability constraints ⋮ Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ Staff assignment policies for a mass casualty event queuing network ⋮ Scheduling policies for an antiterrorist surveillance system ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ Sensitivity Analysis in Markov Decision Processes with Uncertain Reward Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A duality approach to admission and scheduling controls of queues
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Expulsion and scheduling control for multiclass queues with heterogeneous servers
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Optimal threshold policies in a workload model with a variable number of service phases per job
- Restless bandits, partial conservation laws and indexability
- Improving Service by Informing Customers About Anticipated Delays
- A Multiserver Queueing System with Impatient Customers
- Addendum to ‘On an index policy for restless bandits'
- On stochastic scheduling problems with due dates
- The Multi-Armed Bandit Problem: Decomposition and Computation
- On an index policy for restless bandits
- Optimal Expulsion Control—A Dual Approach to Admission Control of an Ordered-Entry System
- Index policies for a class of discounted restless bandits
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Computation of a near-optimal service policy for a single-server queue with homogeneous jobs
This page was built for publication: On the optimal allocation of service to impatient tasks
