Text
Asymptotically Optimal Allocation Policies for Transplant Queueing Systems
We consider the problem of dynamic allocation of organs to patients in a transplant system. The system is modeled as a multiclass bipartite matching system, in which patients may die/delist or move between classes due to changes of their health status. We study a stochastic queueing control problem (QCP) with the control process governing the allocation of each arriving organ, and the objective of maximizing the expected total life years, which consists of both pre- and posttransplant years, of the entire population in the system during a finite time horizon. We first construct a deterministic control problem, referred to as the fluid control problem (FCP), and show that it serves as a performance upper bound for the QCP. We next develop an asymptotic framework, in which large scaled overloaded transplant systems are considered, and show that the fluid scaled QCP attains the FCP upper bound asymptotically. We then propose a simple priority type policy for the QCP based on the optimal solution of the FCP, and establish its asymptotic optimality through a scaling limit theorem. Last, we conduct sensitivity analysis of the FCP with respect to the input parameters and functions to demonstrate the robustness of the proposed policy.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art138468 | null | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain