×

A new look at organ transplantation models and double matching queues. (English) Zbl 1213.90085

Summary: In this paper we propose a prototype model for the problem of managing waiting lists for organ transplantations. Our model captures the double-queue nature of the problem: there is a queue of patients, but also a queue of organs. Both may suffer from “impatience”: the health of a patient may deteriorate, and organs cannot be preserved longer than a certain amount of time. Using advanced tools from queueing theory, we derive explicit results for key performance criteria: the rate of unsatisfied demands and of organ outdatings, the steady-state distribution of the number of organs on the shelf, the waiting time of a patient, and the long-run fraction of time during which the shelf is empty of organs.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
92C50 Medical applications (general)
Full Text: DOI

References:

[1] Perry, Mathematical Methods of Operations Research 50 pp 77– (1999)
[2] DOI: 10.1017/S0269964800000395 · Zbl 1133.90415 · doi:10.1017/S0269964800000395
[3] DOI: 10.1287/opre.1080.0613 · Zbl 1167.90674 · doi:10.1287/opre.1080.0613
[4] DOI: 10.2307/3214576 · Zbl 0761.60065 · doi:10.2307/3214576
[5] DOI: 10.2307/1427076 · Zbl 0536.60089 · doi:10.2307/1427076
[6] DOI: 10.1017/S0269964800003983 · Zbl 1335.60163 · doi:10.1017/S0269964800003983
[7] DOI: 10.1177/0272989X9701700206 · doi:10.1177/0272989X9701700206
[8] Cohen, On regenerative processes in queueing theory (1976) · Zbl 0323.60083 · doi:10.1007/978-3-642-95281-4
[9] DOI: 10.1287/mnsc.18.7.349 · Zbl 0238.90054 · doi:10.1287/mnsc.18.7.349
[10] Brill, Level crossing methods in stochastic models (2008) · Zbl 1157.60003 · doi:10.1007/978-0-387-09421-2
[11] DOI: 10.1017/S0269964800001728 · Zbl 1134.90401 · doi:10.1017/S0269964800001728
[12] DOI: 10.1080/15326340802648878 · Zbl 1178.60062 · doi:10.1080/15326340802648878
[13] DOI: 10.1287/opre.33.3.491 · Zbl 0567.90062 · doi:10.1287/opre.33.3.491
[14] DOI: 10.1239/jap/1269610821 · Zbl 1194.60055 · doi:10.1239/jap/1269610821
[15] Asmussen, Applied probability and queues (2003)
[16] DOI: 10.1287/opre.48.4.549.12418 · doi:10.1287/opre.48.4.549.12418
[17] DOI: 10.1287/mnsc.48.3.328.7732 · Zbl 1232.90298 · doi:10.1287/mnsc.48.3.328.7732
[18] DOI: 10.1023/A:1019162331525 · Zbl 0934.90026 · doi:10.1023/A:1019162331525
[19] Ur, Algorithms, software, architectures pp 458– (1992)
[20] DOI: 10.1287/mnsc.1060.0541 · Zbl 1232.90294 · doi:10.1287/mnsc.1060.0541
[21] DOI: 10.1287/opre.1040.0180 · Zbl 1165.90547 · doi:10.1287/opre.1040.0180
[22] DOI: 10.1287/msom.1040.0056 · doi:10.1287/msom.1040.0056
[23] DOI: 10.1287/opre.37.2.329 · Zbl 0674.90033 · doi:10.1287/opre.37.2.329
[24] DOI: 10.1007/BF01148942 · Zbl 0835.60080 · doi:10.1007/BF01148942
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.