SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- 27 May 2008
- journal article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 22 (3), 301-332
- https://doi.org/10.1017/s0269964808000272
Abstract
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 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 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.Keywords
This publication has 30 references indexed in Scilit:
- On the optimal allocation of service to impatient tasksJournal of Applied Probability, 2004
- Patterns of injury in hospitalized terrorist victimsThe American Journal of Emergency Medicine, 2003
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay RulesOperations Research, 2003
- A Diffusion Approximation for a Markovian Queue with RenegingQueueing Systems, 2003
- National strategy for mass casualty situations and its effects on the hospital.Prehospital and Disaster Medicine, 2002
- Expulsion and scheduling control for multiclass queues with heterogeneous serversQueueing Systems, 2000
- A duality approach to admission and scheduling controls of queuesQueueing Systems, 1994
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtimeJournal of Applied Probability, 1986
- Minimizing the expected weighted number of tardy jobs in stochastic flow shopsOperations Research Letters, 1986
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functionsJournal of Applied Probability, 1980