SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
From MaRDI portal
Publication:3521206
DOI10.1017/S0269964808000272zbMath1211.90105OpenAlexW2145110173MaRDI QIDQ3521206
Serhan Ziya, Nilay Tanık Argon, Rhonda Righter
Publication date: 21 August 2008
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964808000272
Stochastic scheduling theory in operations research (90B36) Theory of organizations, manpower planning in operations research (90B70)
Related Items (21)
Personalized queues: the customer view, via a fluid model of serving least-patient first ⋮ Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation ⋮ 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 ⋮ Data-stories about (im)patient customers in tele-queues ⋮ Strategic behavior and social optimization in a clearing queueing system with \(N\)-policy and stochastic restarting scheme ⋮ Two‐class constrained optimization with applications to queueing control ⋮ Dynamic control of a single-server system with abandonments ⋮ MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE ⋮ A Bayesian approach to the triage problem with imperfect classification ⋮ Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method ⋮ MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system ⋮ On priority queues with impatient customers ⋮ Optimal service order for mass-casualty incident response ⋮ Triage Scheduling Optimization for Mass Casualty and Disaster Response ⋮ Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers ⋮ DYNAMIC CONTROL OF A SINGLE-SERVER SYSTEM WHEN JOBS CHANGE STATUS
Cites Work
- Scheduling stochastic jobs with due dates on parallel machines
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Job scheduling to minimize expected weighted flowtime on uniform processors
- A duality approach to admission and scheduling controls of queues
- Expulsion and scheduling control for multiclass queues with heterogeneous servers
- Analysis of multivariate survival data
- Asymptotic results and a Markovian approximation for the \(M(n)/M(n)/s+GI\) system
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- A diffusion approximation for a Markovian queue with reneging
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Optimal scheduling with strict deadlines
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
- On stochastic scheduling problems with due dates
- Minimizing expected makespans on uniform processor systems
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Optimal allocation of a server between two queues with due times
- On the optimal allocation of service to impatient tasks
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
- \(M/M/1\) queue with impatient customers of higher priority
- The virtual waiting time of the M/G/1 queue with impatient customers
This page was built for publication: SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
