مقاله انگلیسی رایگان در مورد روش های حل مساله بهینه سازی سینی – الزویر ۲۰۱۸

elsevier

 

مشخصات مقاله
ترجمه عنوان مقاله روش های حل مساله بهینه سازی سینی
عنوان انگلیسی مقاله Solution methods for the tray optimization problem
انتشار مقاله سال ۲۰۱۸
تعداد صفحات مقاله انگلیسی  ۳۴ صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
پایگاه داده نشریه الزویر
نوع نگارش مقاله
مقاله پژوهشی (Research article)
مقاله بیس این مقاله بیس نمیباشد
نمایه (index) scopus – master journals – JCR
نوع مقاله ISI
فرمت مقاله انگلیسی  PDF
ایمپکت فاکتور(IF)
۳٫۴۲۸ در سال ۲۰۱۷
شاخص H_index ۲۱۱ در سال ۲۰۱۸
شاخص SJR ۲٫۴۳۷ در سال ۲۰۱۸
رشته های مرتبط  اقتصاد – ریاضی
گرایش های مرتبط  اقتصادسنجی – ریاضی کاربردی
نوع ارائه مقاله
ژورنال
مجله / کنفرانس European Journal of Operational Research
دانشگاه Erasmus School of Economics, Erasmus University Rotterdam, P.O. Box 1738, 3000DR Rotterdam, The Netherlands
کلمات کلیدی OR در خدمات سلامتی، موجودی استریل شده، برنامه ریزی خطی صحیح، تولید سطر و ستون و اکتشافی
کلمات کلیدی انگلیسی OR in Health Services, Sterile Inventory, Integer Linear Programming, Row and Column Generation, Heuristics
شناسه دیجیتال – doi
https://doi.org/10.1016/j.ejor.2018.05.051
کد محصول E11745
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

فهرست مطالب مقاله:
Highlights
Abstract
Keywords
۱٫ Introduction
۲٫ Problem formulation
۳٫ Solution methodology
۴٫ Simulation design
۵٫ Computational results
۶٫ Conclusions and recommendations
Acknowledgments
Appendix A. Column & row generation: proofs and derivations
Appendix B. Tray assignment problem is NP-hard
References

بخشی از متن مقاله:

Abstract

In order to perform medical surgeries, hospitals keep large inventories of surgical instruments. These instruments need to be sterilized before each surgery. Typically the instruments are kept in trays. Multiple trays may be required for a single surgery, while a single tray may contain instruments that are required for multiple surgical procedures. The tray optimization problem (TOP) consists of three main decisions: (i) the assignment of instruments to trays, (ii) the assignment of trays to surgeries, and (iii) the number of trays to keep in inventory. The TOP decisions have to be made such that total operating costs are minimized and such that for every surgery sufficient instruments are available. This paper presents and evaluates several exact and heuristic solution methods for the TOP. We compare solution methods on computation time and solution quality. Moreover, we conduct simulations to evaluate the performance of the solutions in the long run. The novel methods that are provided are the first methods that are capable of solving instances of realistic size. The most promising method consists of a highly scalable advanced greedy algorithm. Our results indicate that the outcomes of this method are, on average, very close to the outcomes of the other methods investigated, while it may be easily applied by (large) hospitals. The findings are robust with respect to fluctuations in long term OR schedules.

Introduction

Throughout the developed world, health care costs have shown a tremendous increase over the last decades. Since 1970 the inflation adjusted government spending on health care has risen by nearly 5 percent per year (Hagist and Kotlikoff [2005]), currently averaging 9 percent of gross domestic product (OECD [2014]). At the same time, patient waiting lists have become longer and are nowadays a major problem (Worthington [1991]). Managerial efforts to control the steeply rising health care costs and long patient waiting lists have not only placed attention on main health care processes, but have focused especially on efficiency management of various, priorly neglected, side processes. One such side process which has received recent attention is hospital sterilization logistics.

ارسال دیدگاه

نشانی ایمیل شما منتشر نخواهد شد. بخش‌های موردنیاز علامت‌گذاری شده‌اند *