IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v328y2026i3p1054-1067.html

Toward organ shortage resilient allocation policies using real-time queueing models for liver transplantation

Author

Listed:
  • Masanet, Thomas
  • Audry, Benoît
  • Jacquelinet, Christian
  • Moyal, Pascal

Abstract

We report in this paper on the potential interest of real-time queueing models to optimize organ allocation policies. We especially focus on building organ shortage resilient policies in terms of equity, as we experienced differential impact of the COVID epidemic organ shortage on transplant access, according to the cause of liver failure. Patient’s death on the waiting list or dropout for being too sick, resulting from the absence of a timely available organ, is chosen as the main equity metric. Results obtained with the composite allocation score used in France is challenged against the so-called Early Simulated Deadline First (ESDF) real-time queueing discipline, under increasing levels of organ shortage, by extensive simulations. The ESDF policy is a variant of the well-know Earliest Deadline First (EDF) policy, which was shown as optimal in various contexts in the queueing literature. In the present case, the time to the deadline represents the remaining life duration of patients — which is of course unknown. So we propose to simulate a fictional life-duration, and give priority to the earliest simulated deadline. This leads to a simple and comprehensive representation of the system at hand by a Markov process. Our simulation results clearly show that the ESDF policy allows to maintain equity between indications, conversely to the scoring policy, which was not resilient to increasing levels of organ shortage.

Suggested Citation

  • Masanet, Thomas & Audry, Benoît & Jacquelinet, Christian & Moyal, Pascal, 2026. "Toward organ shortage resilient allocation policies using real-time queueing models for liver transplantation," European Journal of Operational Research, Elsevier, vol. 328(3), pages 1054-1067.
  • Handle: RePEc:eee:ejores:v:328:y:2026:i:3:p:1054-1067
    DOI: 10.1016/j.ejor.2025.07.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725005557
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.07.030?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Ivo Adan & Gideon Weiss, 2012. "Exact FCFS Matching Rates for Two Infinite Multitype Sequences," Operations Research, INFORMS, vol. 60(2), pages 475-489, April.
    2. Perlman, Yael & Elalouf, Amir & Yechiali, Uri, 2018. "Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation," European Journal of Operational Research, Elsevier, vol. 265(1), pages 169-177.
    3. repec:inm:orstsy:v:13:y:2023:i:1:p:40-58 is not listed on IDEAS
    4. Ivo Adan & Ana Bušić & Jean Mairesse & Gideon Weiss, 2018. "Reversibility and Further Properties of FCFS Infinite Bipartite Matching," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 598-621, May.
    5. Uri Yechiali, 2022. "Transplant queueing," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 489-491, April.
    6. Israel David & Uri Yechiali, 1985. "A Time-dependent Stopping Problem with Application to Live Organ Transplants," Operations Research, INFORMS, vol. 33(3), pages 491-504, June.
    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. Angelos Aveklouris & Levi DeValve & Maximiliano Stock & Amy Ward, 2025. "Matching Impatient and Heterogeneous Demand and Supply," Operations Research, INFORMS, vol. 73(3), pages 1637-1658, May.
    2. Uri Yechiali, 2022. "Transplant queueing," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 489-491, April.
    3. Jean Mairesse & Pascal Moyal, 2022. "New frontiers for stochastic matching," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 473-475, April.
    4. Kristen Gardner & Rhonda Righter, 2020. "Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 3-51, October.
    5. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List," Operations Research, INFORMS, vol. 55(1), pages 24-36, February.
    6. Refael Hassin & Adam Nathaniel, 2021. "Self-Selected Task Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 23(6), pages 1669-1682, November.
    7. Glanzer, Martin & Maier, Sebastian & Pflug, Georg Ch., 2025. "Guaranteed bounds for optimal stopping problems using kernel-based non-asymptotic uniform confidence bands," European Journal of Operational Research, Elsevier, vol. 327(1), pages 162-173.
    8. Li, Mengling & Riyanto, Yohanes E. & Xu, Menghan, 2023. "Prioritized organ allocation rules under compatibility constraints," Games and Economic Behavior, Elsevier, vol. 141(C), pages 403-427.
    9. Jose H. Blanchet & Martin I. Reiman & Viragh Shah & Lawrence M. Wein & Linjia Wu, 2020. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Papers 2002.03205, arXiv.org, revised Jun 2021.
    10. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    11. Levy, Amnon, 2005. "A decision-rule for transplanting non-cadaveric organs," European Journal of Operational Research, Elsevier, vol. 164(2), pages 548-554, July.
    12. Sahar Ahmadvand & Mir Saman Pishvaee, 2018. "An efficient method for kidney allocation problem: a credibility-based fuzzy common weights data envelopment analysis approach," Health Care Management Science, Springer, vol. 21(4), pages 587-603, December.
    13. Theophilus Dhyankumar Chellappa & Ramasubramaniam Muthurathinasapathy & V. G. Venkatesh & Yangyan Shi & Samsul Islam, 2023. "Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective," Annals of Operations Research, Springer, vol. 321(1), pages 755-781, February.
    14. Heng-Li Liu & Quan-Lin Li, 2023. "Matched Queues with Flexible and Impatient Customers," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-26, March.
    15. Amir Elalouf & Ariel Rosenfeld & Ofir Rockach, 2023. "The Extended David-Yechiali Rule for Kidney Allocation," Mathematics, MDPI, vol. 11(2), pages 1-16, January.
    16. Perlman, Yael & Elalouf, Amir & Yechiali, Uri, 2018. "Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation," European Journal of Operational Research, Elsevier, vol. 265(1), pages 169-177.
    17. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2004. "The Optimal Timing of Living-Donor Liver Transplantation," Management Science, INFORMS, vol. 50(10), pages 1420-1430, October.
    18. Itai Ashlagi & Maximilien Burq & Patrick Jaillet & Vahideh Manshadi, 2019. "On Matching and Thickness in Heterogeneous Dynamic Markets," Operations Research, INFORMS, vol. 67(4), pages 927-949, July.
    19. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    20. Burak Büke & Hanyi Chen, 2017. "Fluid and diffusion approximations of probabilistic matching systems," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 1-33, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:ejores:v:328:y:2026:i:3:p:1054-1067. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.