The complex optimisation problems arising in the scheduling of operating rooms have received considerable attention in recent scientific literature because of their impact on costs, revenues and patient health. For an important part, the complexity stems from the stochastic nature of the problem. In practice, this stochastic nature often leads to schedule adaptations on the day of schedule execution. While operating room performance is thus importantly affected by such adaptations, decision-making on adaptations is hardly addressed in scientific literature. Building on previous literature on adaptive scheduling, we develop adaptive operating room scheduling models and problems, and analyse the performance of corresponding adaptive scheduling policies. As previously proposed (fully) adaptive scheduling models and policies are infeasible in operating room scheduling practice, we extend adaptive scheduling theory by introducing the novel concept of committing. Moreover, the core of the proposed adaptive policies with committing is formed by a new, exact, pseudo-polynomial algorithm to solve a general class of stochastic knapsack problems. Using these theoretical advances, we present performance analysis on practical problems, using data from existing literature as well as real-life data from the largest academic medical centre in The Netherlands. The analysis shows that the practically feasible, basic, 1-level policy already brings substantial and statistically significant improvement over static policies. Moreover, as a rule of thumb, scheduling surgeries with large mean duration or standard deviation early appears good practice.
Living donor kidney transplantation (LTx) is the preferred treatment for patients with end-stage renal disease. Kidney exchange programs (KEPs) promote LTx by facilitating exchange of donors among patients who are not compatible with their donors. We analyze and maximize the efficacy and effectiveness of KEPS from a health value perspective and the health value of altruistic donation in KEPs. Methods:We developed a Markov model for the health outcomes of patients, which was embedded in a discrete event simulation model to assess the effectiveness of allocation policies in KEPs. A new allocation policy to maximize health value was developed on the basis of integer programing techniques. The evidence-based transition probabilities in the Markov model were based on data from the Dutch KEP using a variety of econometric models. Scenarios analysis was presented to improve robustness.Results: The efficacy of the Dutch KEP without altruistic donation is reflected by the increase in expected discounted qualityadjusted life-years (QALYs) by 3.23 from 6.42 to 9.65. The present Dutch policy and the policy to maximize the number of transplants achieve 63% of the potential efficacy gain (2.11 discounted QALYs). The new policy achieves 69% of this gain (2.33 discounted QALYs). When systematically enrolling altruistic donors in the KEP, the new policy increased expected discounted QALYs by 4.05 to 10.27 and reduced inequities for patients with blood type O. Conclusions:The Dutch KEP can increase health value for patients by more than half. An allocation policy that maximizes health outcomes and maximally allows altruistic donation can yield significant further improvements.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.