Scheduling impatient jobs in a clearing system with insights on patient triage in mass casualty incidents

Probability in the Engineering and Informational Sciences

Volumn 22, Issue 3, 2008, Pages 301-332

  Argon, Nilay Tanik ^a   Ziya, Serhan ^a   Righter, Rhonda ^b  

^a University of North Carolina at Chapel Hill   (United States)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMERGENCY SERVICES; OPTIMIZATION;

EMERGENCY RESPONSE; HAZARD RATE ORDER; HEURISTIC POLICIES; LIKELIHOOD RATIO ORDER; MASS CASUALTY INCIDENTS; PARTIAL CHARACTERIZATION; SERVICE TIME DISTRIBUTION; WORST CASE SCENARIO;

JOB SHOP SCHEDULING;

EID: 44349189942     PISSN: 02699648     EISSN: 14698951     Source Type: Journal    
DOI: 10.1017/S0269964808000272     Document Type: Article

References (34)

1. Arnold, J.L., Tsai, M.-C., Halpern, P., Smithline, H., Stok, E., & Ersoy, G. (2004). Mass-casualty, terrorist bombings: Epidemiological outcomes, resource utilization, and time course of emergency needs (Part I). Prehospital and Disaster Medicine 18(3): 220-234.
2. Bae, J., Kim, S., &Lee, E.Y. (2001). The virtual waiting timeof M/G/1 queue with impatient customers. Queueing Systems 38: 485-494.
3. Bhattacharya, P.P. & Ephremides, A. (1989). Optimal scheduling with strict deadlines. IEEE Transactions on Automatic Control 34(7): 721-728.
4. Bhattacharya, P.P. & Ephremides, A. (1991). Optimal allocation of a server between two queues with due times. IEEE Transactions on Automatic Control 36(12): 1417-1423.
5. Boxma, O.J. &Forst, F.G. (1986). Minimizing the expected weighted number oftardy jobs instochastic flow shops. Operations Research Letters 5(3): 119-126.
6. Brandt, A. & Brandt, M. (2002). Asymptotic results and a Markovian appproximation for the M(n)/M(n)/s + GI system. Queueing Systems 41: 73-94.
7. Brandt, A. & Brandt, M. (2004). On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers. Queueing Systems 47: 147-168.
8. Choi, B.D., Kim, B., & Chung, J. (2001). M/M/1 queue with impatient customers of higher priority. Queueing Systems 38: 49-66.
9. Coffman, E.G., Flatto, L., Garey, M.R., & Weber, R.R. (1987). Minimizing expected makespan on uniform processor systems. Advances in Applied Probability 19: 177-201.
10. Doytchinov, B., Lehoczky, J., & Shreve, S. (2001). Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Annals of Applied Probability 11(2): 332-378.
11. Emmons, H. & Pinedo, M. (1990). Scheduling stochastic jobs with due dates on parallel machines. European Journal of Operational Research 47(1): 49-55.
12. Frykberg, E.R. (2002). Medical management of disasters and mass casualties from terrorist bombings: How can we cope? The Journal of Trauma 53(2): 201-212.
13. Glazebrook, K.D. (1983). Stochastic scheduling with due dates. International Journal of Systems Science 14: 1259-1271.
14. Glazebrook, K.D., Ansell, P.S., Dunn, R.T., & Lumley, R.R. (2004). On the optimal allocation of service to impatient tasks. Journal of Applied Probability 41(1): 51-72.
15. Hougaard, P. (2000). Analysis of multivariate survival data. New York: Springer-Verlag.
16. Jang, W. & Klein, C.M. (2002). Minimizing the expected number of tardy jobs when processing times are normally distributed. Operations Research Letters 30: 100-106.
17. Jiang, Z., Lewis, T.G., & Colin, J.-Y. (1996). Scheduling hard real-time constrained periodic tasks on multiple processors. Journal of Systems and Software 19: 102-118.
18. Levi, L., Michaelson, M., Admi, H., Bregman, D., & Bar-Nahor, R. (2003). National strategy for mass casualty situations and its effects on the hospital. Prehospital and Disaster Medicine 17(1): 12-17.
19. Nocera, A. & Garner, A. (1999). An Australian Mass Casualty Incident triage system for the future based upon triage mistakes of the past: The Homebush Triage Standard. Australian and New Zealand Journal of Surgery 69: 603-608.
20. Panwar, S.S., Towsley, D., & Wolf, J.K. (1988). Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. Journal of the Association for Computing Machinery 35(4): 832-844.
21. Peleg, K., Aharonson-Daniel, L., Michael, M., Shapira, S.C., & the Israel Trauma Group. (2003). Patterns of injury in hospitalized terrorist victims. American Journal of Emergency Medicine 21(4): 258-262.
22. Pinedo, M. (1983). Stochastic Scheduling with release dates and due dates. Operations Research 31(3): 559-572.
23. Righter, R. (1994). Scheduling. I.M. Shaked & J.G. Shanthikumar (eds.), Stochastic orders. NewYork: Academic Press, pp. 381-432.
24. Righter, R. (1988). Job scheduling to minimize weighted flowtime on uniform processors. Systems and Control Letters 10: 211-216.
25. Righter, R. (2000). Expulsion and scheduling control for multiclass queues with heterogenous servers. Queueing Systems 34: 289-300.
26. Rund, D.A. & Rausch, T.S. (1981). Triage. St. Louis, MO: C.V. Mosby.
27. Van Mieghem, J. (1995). Dynamic scheduling with convex delay costs: the generalized cμ rule. Annals of Applied Probability 5(3): 808-833.
28. Van Mieghem, J. (2003). Due date scheduling: asymptotic optimality of generalized longest queue and generalized largest delay rules. Operations Research 51(1): 113-122.
29. Ward, A.R. & Glynn, P.W. (2003). A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43: 103-128.
30. Ward, A.R. & Kumar, S. (2008). Asymptotically optimal admission control of a queue with impatient customers. Mathematics of Operations Research 33: 167-202.
31. Weber, R.R., Varaiya, P., & Walrand, J. (1986). Scheduling jobs with stochastically ordered processing timesonparallel machinestominimize expectedflow time.Journal of Applied Probability23: 841-847.
32. Weiss, G. & Pinedo, M. (1980). Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. Journal of Applied Probability 17: 187-202.
33. Xu, S.H. (1994).A duality approach to admission and scheduling control of queues. Queueing Systems 18: 273-300.
34. Zhao, Z.-X., Panwar, S.S., & Towsley, D. (1991). Queueing performance with impatient customers. Proceedings of IEEE INFOCOM'91 1: 400-409.