کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10523881 | 957123 | 2014 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling elective surgeries with sequence-dependent setup times to multiple operating rooms using constraint programming
ترجمه فارسی عنوان
برنامه ریزی جراحی های انتخابی با زمان راه اندازی وابسته به دنباله به چندین اتاق عمل با استفاده از برنامه ریزی محدودیت
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
برنامه ریزی جراحی انتخابی، اتاق عمل چندگانه، زمان راه اندازی وابسته به توالی، محدودیت برنامه ریزی، برنامه ریزی غیر خطی عدد صحیح مختلط،
موضوعات مرتبط
علوم پزشکی و سلامت
پزشکی و دندانپزشکی
سیاست های بهداشت و سلامت عمومی
چکیده انگلیسی
The problem studied in this paper is to schedule elective surgeries (in contrast to urgent surgeries) to multiple operating rooms (ORs) in ambulatory surgical settings. We focus on three aspects of the daily scheduling decisions, including the number of ORs to open, the allocation of surgery-to-OR, and the sequence of surgeries in each OR. All the surgeries to be scheduled are known in advance, which is a common assumption for elective surgery scheduling problems. The surgeries belong to different types, and each OR can only allow certain types of surgeries to be performed. Before a surgery starts, some setup work needs to be done, such as sterilization and preparing required equipment. The setup times are assumed sequence-dependent, and both setup times and surgery durations are deterministic. The fixed costs of running the ORs are high; while sometimes overtime costs, which are even higher than the fixed costs, may occur when the surgeries cannot be done within the normal operating period of the ORs. We build a Mixed Integer Nonlinear Programming (MINLP) model and a Constraint Programming (CP) model to solve this problem. The performance of these two models is tested on numerical examples, and the results show that the CP model is more efficient than the MINLP model in terms of the computational time and solution quality. We also examine the sensitivity of the solutions to the variation of surgery durations, and the analysis shows that the total costs do not change much when the variations of surgery durations are small.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research for Health Care - Volume 3, Issue 3, September 2014, Pages 160-167
Journal: Operations Research for Health Care - Volume 3, Issue 3, September 2014, Pages 160-167
نویسندگان
Zhaoxia Zhao, Xueping Li,