IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v60y2012i4p813-832.html
   My bibliography  Save this article

Priority Assignment in Emergency Response

Author

Listed:
  • Evin Uzun Jacobson

    (Imperial College Business School, London SW7 2AZ, United Kingdom)

  • Nilay Tanık Argon

    (Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, North Carolina 27599)

  • Serhan Ziya

    (Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, North Carolina 27599)

Abstract

In the aftermath of mass-casualty events, key resources (such as ambulances and operating rooms) can be overwhelmed by the sudden jump in patient demand. To ration these resources, patients are assigned different priority levels, a process that is called triage. According to triage protocols in place, each patient's priority level is determined based on that patient's injuries only. However, recent work from the emergency medicine literature suggests that when determining priorities, resource limitations and the scale of the event should also be taken into account in order to do the greatest good for the greatest number . This article investigates how this can be done and what the potential benefits would be. We formulate the problem as a priority assignment problem in a clearing system with multiple classes of impatient jobs. Jobs are classified based on their lifetime (i.e., their tolerance for wait), service time, and reward distributions. Our objective is to maximize the expected total reward, e.g., the expected total number of survivors. Using sample-path methods and stochastic dynamic programming, we identify conditions under which the state information is not needed for prioritization decisions. In the absence of these conditions, we partially characterize the optimal policy, which is possibly state dependent, and we propose a number of heuristic policies. By means of a numerical study, we demonstrate that simple state-dependent policies that prioritize less urgent jobs when the total number of jobs is large perform well, especially when jobs are time-critical.

Suggested Citation

  • Evin Uzun Jacobson & Nilay Tanık Argon & Serhan Ziya, 2012. "Priority Assignment in Emergency Response," Operations Research, INFORMS, vol. 60(4), pages 813-832, August.
  • Handle: RePEc:inm:oropre:v:60:y:2012:i:4:p:813-832
    DOI: 10.1287/opre.1120.1075
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1120.1075
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1120.1075?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Emmons, Hamilton & Pinedo, Michael, 1990. "Scheduling stochastic jobs with due dates on parallel machines," European Journal of Operational Research, Elsevier, vol. 47(1), pages 49-55, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    2. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    3. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
    4. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    5. Jonathan Turner & Soonhui Lee & Mark Daskin & Tito Homem-de-Mello & Karen Smilowitz, 2012. "Dynamic fleet scheduling with uncertain demand and customer flexibility," Computational Management Science, Springer, vol. 9(4), pages 459-481, November.
    6. Ali Allahverdi & John Mittenthal, 1994. "Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 677-682, August.
    7. Yalaoui, Farouk & Chu, Chengbin, 2002. "Parallel machine scheduling to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 76(3), pages 265-279, April.
    8. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    9. Michele E. Pfund & John W. Fowler, 2017. "Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3294-3307, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:60:y:2012:i:4:p:813-832. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.