Operations Research for Health Care最新文献_第9页

Introducing article numbering to Operations Research for Health Care 将文章编号引入医疗运筹学

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/S2211-6923(19)30102-X

Simon Jones

引用次数: 0

Lognormal-based mixture models for robust fitting of hospital length of stay distributions 基于对数正态的混合模型稳健性拟合住院时间分布

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.04.002

Xu Zhang , Sean Barnes , Bruce Golden , Miranda Myers , Paul Smith

{"title":"Lognormal-based mixture models for robust fitting of hospital length of stay distributions","authors":"Xu Zhang , Sean Barnes , Bruce Golden , Miranda Myers , Paul Smith","doi":"10.1016/j.orhc.2019.04.002","DOIUrl":"10.1016/j.orhc.2019.04.002","url":null,"abstract":"<div><p>Understanding the structure of length of stay distributions can support operational and clinical decision making in hospitals. Our objective is to develop robust methods for fitting these length of stay distributions, which are often skewed and multimodal and contain a significant number of outliers. We define several lognormal-based mixture distributions with two components, one to fit the majority of observations and one to fit the abnormal observations. Specifically, we propose three lognormal-based mixture distributions, one that utilizes the exponential distribution as the second component, one that utilizes the gamma distribution, and one that utilizes the lognormal distribution. We estimate the parameters for each mixture model using the expectation–maximization (EM) algorithm, and validate our models using simulation. Finally, we compare the fit of our mixture models against different distributional fits using real data collected from multiple studies conducted by researchers at the University of Maryland School of Medicine and their colleagues.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100184"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.04.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47013464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Adaptive operating rooms planning and scheduling: A rolling horizon approach 适应性手术室规划和调度:滚动地平线方法

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100200

Mehdi A. Kamran , Behrooz Karimi , Nico Dellaert , Erik Demeulemeester

{"title":"Adaptive operating rooms planning and scheduling: A rolling horizon approach","authors":"Mehdi A. Kamran , Behrooz Karimi , Nico Dellaert , Erik Demeulemeester","doi":"10.1016/j.orhc.2019.100200","DOIUrl":"10.1016/j.orhc.2019.100200","url":null,"abstract":"<div><p>Accounting for a large portion of the hospital’s total revenue and cost, better management of the operating rooms is extremely important in improving healthcare resource utilization. This paper investigates the <em>Operating Rooms</em> (<em>ORs</em>) <em>Planning and Scheduling Problem</em> in a hospital with a <em>modified block scheduling policy</em>. Thus, the candidate patients have to be assigned a date and an operating room/block as well as being sequenced in the assigned operating rooms/blocks. A <em>reserved slack policy</em><span> is considered to take care of the arrival of emergency patients. Surgery durations are considered to be randomly distributed. In this regard, a stochastic mixed integer linear programming model is proposed that includes different patient, staff and surgeon preferences: minimization of the total patient waiting time, the tardiness, the number of cancellations, the patient surgery start times, the block overtime, the number of surgeon’s surgery days within the planning horizon and the sum of the idle times of the surgeons. Two different 2-phase heuristic solution approaches are developed in a rolling horizon framework in order to solve the </span><em>Adaptive ORs Planning and Scheduling Problem</em>. The efficiency of the solution framework is surveyed by applying real data obtained from hospital records through numerical experiments. The results show that the developed solution framework significantly outperforms the commercial solver CPLEX in terms of solution quality and CPU time, in medium- as well as in large-sized problems. Furthermore, the results show that the assumptions and features made to the formulation (i.e. the modified block scheduling policy, the reserved slack policy, and the stochastic surgery durations) will result in more efficient solutions.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100200"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100200","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47575218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Chance-constrained admission scheduling of elective surgical patients in a dynamic, uncertain setting 动态、不确定环境下择期手术患者的机会约束住院安排

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100196

Wim Vancroonenburg , Patrick De Causmaecker , Greet Vanden Berghe

{"title":"Chance-constrained admission scheduling of elective surgical patients in a dynamic, uncertain setting","authors":"Wim Vancroonenburg , Patrick De Causmaecker , Greet Vanden Berghe","doi":"10.1016/j.orhc.2019.100196","DOIUrl":"10.1016/j.orhc.2019.100196","url":null,"abstract":"<div><p>In the present contribution, a chance-constrained scheduling model is presented for determining admission dates of elective surgical patients. The admission scheduling model is defined considering a dynamic, stochastic decision-making environment. The primary aim of the model concerns the minimization of operating theatre costs and patient waiting times, while simultaneously avoiding bed shortages at a fixed certainty level through a chance-constrained formulation. This stochastic model is implemented by means of sample average approximation and is solved by a meta-heuristic algorithm. To illustrate the applicability of the model, the approach is used to implement four admission scheduling policies on this dynamic decision-making setting that are evaluated on different criteria in a computational study using simulation. The results show that the stochastic approach is able to account for the uncertainty in patients’ length of stay and surgical procedure duration, enabling it to avoid bed shortages while still optimizing operating theatre costs and patient waiting times.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100196"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43034730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Optimal integration of desensitization protocols into kidney paired donation (KPD) programs 脱敏方案与肾脏配对捐献(KPD)方案的最佳整合

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100198

Fatemeh Karami , Monica Gentili , Mehdi Nayebpour , Naoru Koizumi , J. Keith Melancon

{"title":"Optimal integration of desensitization protocols into kidney paired donation (KPD) programs","authors":"Fatemeh Karami , Monica Gentili , Mehdi Nayebpour , Naoru Koizumi , J. Keith Melancon","doi":"10.1016/j.orhc.2019.100198","DOIUrl":"10.1016/j.orhc.2019.100198","url":null,"abstract":"<div><p>Blood type (ABO) incompatibility and antibody to donor human leukocyte antigen<span> (HLA) remain the most significant barriers in transplantation. While pre-transplant desensitization can be administered to overcome such incompatibilities between living donors and their kidney recipients, desensitization alone is likely to fail for those pairs with significant incompatibilities. For these pairs, desensitization can be administered in combination with Kidney Paired Donor (KPD) exchange, the system that allows incompatible pairs to exchange donors with other incompatible pairs to improve donor–recipient compatibilities. Prior operations research literature on KPD investigates the optimal strategy to match donors to patients within a given set of incompatible pairs. However, models and algorithms in these studies exclusively look for the best possible match without considering the possibility of combining KPD and desensitization therapy. The current study adapted the existing models to incorporate desensitization as a way to increase KPD efficiency and embedded it into a simulation framework to evaluate the impact of optimally integrating a desensitization protocol in a KPD program. This is the first attempt to quantify the benefit of such an integration. Our results indicated that desensitization as part of a KPD exchange program is a promising approach to improve access to and to reduce wait time for a living donor renal transplant.</span></p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100198"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100198","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48902637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A comparison of population segmentation methods 人口分割方法的比较

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100192

R.M. Wood , B.J. Murch , R.C. Betteridge

{"title":"A comparison of population segmentation methods","authors":"R.M. Wood , B.J. Murch , R.C. Betteridge","doi":"10.1016/j.orhc.2019.100192","DOIUrl":"10.1016/j.orhc.2019.100192","url":null,"abstract":"<div><p>This paper presents the first comparison of descriptive segmentation methods for population health management. The aim of descriptive segmentation is to identify heterogeneous segments according to some target observed measure. In healthcare it can be used to understand how utilisation is distributed among a population, and to identify the patient attributes which explain the greatest differences (knowledge of which can help shape segment-tailored services). In reviewing a number of segmentation methods that are both employed on the ground and explored more experimentally within the academic literature, this paper aims to open up a range of options allowing clinicians and managers an informed choice on which approach to use for their situation. Results support the recommendation that decision tree approaches are on-the-whole most suitable, being configurable to local data and providing the best inter-segment discrimination. More basic judgemental splits on patient attributes can be powerful, with the count of chronic conditions being a key variable. Prescribed binning methods such as Bridges to Health are unlikely to achieve high levels of discrimination but do have easily interpretable segments and could be useful for benchmarking. Clustering methods are found to lack discriminative power, which can be attributed to a lack of conceptual appropriateness to the problem.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100192"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100192","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42335557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Minimizing Earliness/Tardiness costs on multiple machines with an application to surgery scheduling 将多台机器的早/迟到成本最小化并应用于手术调度

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100194

Maarten Otten, Aleida Braaksma, Richard J. Boucherie

{"title":"Minimizing Earliness/Tardiness costs on multiple machines with an application to surgery scheduling","authors":"Maarten Otten, Aleida Braaksma, Richard J. Boucherie","doi":"10.1016/j.orhc.2019.100194","DOIUrl":"10.1016/j.orhc.2019.100194","url":null,"abstract":"<div><p>Early or tardy surgeries are frustrating for both patients and personnel, and cause inefficient use of resources at the operating rooms. The stochastic Earliness/Tardiness (E/T) scheduling problem addresses this by minimizing the total expected deviation of the surgery completion times from the planned completion times. We introduce the concept of E/T-concavity as a property of a probability distribution if the E/T costs are concave as a function of the standard deviation of the completion time, whenever the optimal planned completion times are selected. We use this concept to generate an optimal schedule for the multiple machine variant of the E/T problem. The optimal schedule is not unique and therefore allows us to consider several optimization objectives in addition to the E/T objective. We demonstrate the usefulness of our results in practice by proving E/T-concavity for several probability distributions and by showing that, under the assumption of E/T-concavity, a simple Shortest Variance First (SVF) rule is optimal. We conclude by providing a numerical example of surgery scheduling where we demonstrate the benefits of the SVF rule compared to several commonly used scheduling rules.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"22 ","pages":"Article 100194"},"PeriodicalIF":2.1,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100194","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49107037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Examination-order scheduling for minimizing waiting time: A case study of a medical checkup 减少等待时间的检查顺序安排:一个医疗检查的案例研究

IF 2.1

Operations Research for Health Care Pub Date : 2019-09-01 DOI: 10.1016/j.orhc.2019.100190

Mari Ito , Shizuka Hara , Mirai Tanaka , Ryuta Takashima

引用次数: 1

Needy boarding patients in emergency departments: An exploratory case study using discrete-event simulation 急诊科有需要的寄宿病人:使用离散事件模拟的探索性案例研究

IF 2.1

Operations Research for Health Care Pub Date : 2019-06-01 DOI: 10.1016/j.orhc.2019.02.002

Kim De Boeck , Raïsa Carmen , Nico Vandaele

{"title":"Needy boarding patients in emergency departments: An exploratory case study using discrete-event simulation","authors":"Kim De Boeck , Raïsa Carmen , Nico Vandaele","doi":"10.1016/j.orhc.2019.02.002","DOIUrl":"10.1016/j.orhc.2019.02.002","url":null,"abstract":"<div><p>Boarding patients and the extra workload they introduce are a major concern in emergency departments. Currently, research on boarding has focused on the beds that these patients occupy while they wait for admission in the inpatient ward. Little attention has been given to the check-ups these patients will inevitably need while waiting. These check-ups also confront the physicians with a challenging task: prioritizing between boarding patients and patients currently under treatment in the emergency department. This article firstly explores the limited previous research on boarding patients. Secondly, this paper quantitatively demonstrates that needy boarding patients can significantly impact system performance and hence should be accounted for in the analysis and planning of an emergency department through discrete-event simulation. Next, three static priority policies (first-come, first-served and always prioritizing either boarding patients or the other patients) and one dynamic priority policy (using accumulating priorities) are evaluated on various performance measures. We find, for our case study, that system performance is optimized by applying a priority policy that favours patients currently under treatment in the emergency department.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"21 ","pages":"Pages 19-31"},"PeriodicalIF":2.1,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.02.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43977052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Improving sustainability in a two-level pharmaceutical supply chain through Vendor-Managed Inventory system 通过供应商管理库存系统提高两级药品供应链的可持续性

IF 2.1

Operations Research for Health Care Pub Date : 2019-06-01 DOI: 10.1016/j.orhc.2019.04.004

Dua Weraikat , Masoumeh Kazemi Zanjani , Nadia Lehoux

{"title":"Improving sustainability in a two-level pharmaceutical supply chain through Vendor-Managed Inventory system","authors":"Dua Weraikat , Masoumeh Kazemi Zanjani , Nadia Lehoux","doi":"10.1016/j.orhc.2019.04.004","DOIUrl":"10.1016/j.orhc.2019.04.004","url":null,"abstract":"<div><p>Hospitals, as the main customers of medications, typically adopt conservative inventory control policies by keeping large quantities of drugs in stock. Given the perishable nature of medications, such strategies lead to the expiration of excess inventory in the absence of patients’ demand. Consequently, producers are faced with governmental penalties and environmental reputation forfeit due to the negative impact that disposing expired medications pose to the environment. This article aims to improve the sustainability of a pharmaceutical supply chain using a real case study. An analytical model is proposed to explore the effect of implementing a Vendor-Managed Inventory (VMI) system in minimizing the quantity of the expired medications at hospitals. Further, a set of Monte-Carlo simulation tests are conducted to investigate the robustness of the VMI model under demand uncertainty. Experimental results on a real case study under deterministic demand show the efficiency of the VMI model in eliminating the amount of expired medications without compromising customer’s satisfaction. The results also demonstrate that the safety stock (SS) level and the capacity assigned to the customer are crucial factors in the overall cost of the pharmaceutical supply chain (PSC). The PSC cost could be reduced by 19% when reducing the SS level by 50%. Moreover, the producer is recommended to increase the capacity assigned to the customer by a factor of 1.5 so as to fully satisfy the customer’s demand. Finally, the simulation results confirm the efficiency and robustness of embracing a VMI system under random demand scenarios. More precisely, zero amount of expired medications is obtained in 93% of cases. Thus, adopting this strategy could minimize drug wastage and ultimately improve the reputation of the producer in the market in terms of implementing Lean and sustainable practices.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"21 ","pages":"Pages 44-55"},"PeriodicalIF":2.1,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.04.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41352671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48