Job scheduling to minimize expected weighted flowtime on uniform processors
Systems & Control Letters
Journal of the ACM (JACM)
Expulsion and scheduling control for multiclass queues with heterogeneous servers
Queueing Systems: Theory and Applications
M/M/1 Queue with Impatient Customers of Higher Priority
Queueing Systems: Theory and Applications
The Virtual Waiting Time of the M/G/1 Queue with Impatient Customers
Queueing Systems: Theory and Applications
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems: Theory and Applications
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers
Queueing Systems: Theory and Applications
Asymptotically Optimal Admission Control of a Queue with Impatient Customers
Mathematics of Operations Research
Minimizing the expected number of tardy jobs when processing times are normally distributed
Operations Research Letters
On priority queues with impatient customers
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Dynamic control of a single-server system with abandonments
Queueing Systems: Theory and Applications
Priority Assignment in Emergency Response
Operations Research
Prioritizing Burn-Injured Patients During a Disaster
Manufacturing & Service Operations Management
Resource-Based Patient Prioritization in Mass-Casualty Incidents
Manufacturing & Service Operations Management
Dynamic fluid-based scheduling in a multi-class abandonment queue
Performance Evaluation
Data-stories about (im)patient customers in tele-queues
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
Motivated by the patient triage problem in emergency response, we consider a single-server clearing system in which jobs might abandon the system if they are not taken into service within their “lifetime.” In this system, jobs are characterized by their lifetime and service time distributions. Our objective is to dynamically determine the optimal or near-optimal order of service for jobs so as to minimize the total number of abandonments. We first show that if the jobs can be ordered in such a way that the job with the shortest lifetime (in the sense of hazard rate ordering) also has the shortest service time (in the sense of likelihood ratio ordering), then the optimal policy gives the highest priority to this “time-critical” job independently of the system state. For the case in which the jobs with shorter lifetimes have longer service times, we observed that the optimal policy generally has a complex structure that might depend on the type and number of jobs available. For this case, we provide partial characterizations of the optimal policy and obtain sufficient conditions under which a state-independent policy is optimal. Furthermore, we develop two state-dependent heuristic policies, and by means of a numerical study, we show that these heuristics perform well, especially when jobs abandon the system at a relatively faster rate when compared to service rates. Based on our analytical and numerical results, we develop several insights on patient triage in the immediate aftermath of a mass casualty event. For example, we conclude that in a worst-case scenario, where medical resources are overwhelmed with a large number of casualties who need immediate attention, it is crucial to implement state-dependent policies such as the heuristic policies proposed in this article.