Operating room scheduling in collaborative hospitals with emergency patient arrival

نوع: Type: thesis

مقطع: Segment: masters

عنوان: Title: Operating room scheduling in collaborative hospitals with emergency patient arrival

ارائه دهنده: Provider: Mahdis lotfi

اساتید راهنما: Supervisors: Javad behnamian (Ph. D)

اساتید مشاور: Advisory Professors:

اساتید ممتحن یا داور: Examining professors or referees: دکتر امیرسامان خیرخواه - دکتر حمید دزفولیان

زمان و تاریخ ارائه: Time and date of presentation: November 2020

مکان ارائه: Place of presentation:

چکیده: Abstract: This study deals with the scheduling of operating room networks of collaborative hospitals with the arrival of emergency patients. In this study, a set of independently owned hospitals form a virtual alliance network to increase resource utilization and reduce patient waiting time. Each hospital, in collaboration with other members, is primarily responsible for providing services to its patients. Each hospital can have a different objective function, which has a priority over the overall objective function of the virtual distributed scheduling collaborative hospitals. The objective function of the problem is divided into two categories so that one group of hospitals considers the completion time of the last surgery of patients and another group has chosen the set of completion times as the objective function. The overall objective function of the distributed scheduling network is to reduce the cost of allocating patients to hospitals and surgeons, along with the cost of operating room overtime. Also, in this study, considering the transfer of the patient from one hospital to another according to the time of patient transportation, the conditions of the studied system have been tried to be as close as possible to the real-world of the health care system. For the above problem, a mixed-integer mathematical programming model is presented, and using two exact solutions including; Benders decomposition algorithm and epsilon constraint and one meta-heuristic solution method including; multi-objective learning variable neighborhood search algorithm is used to minimize the objective functions of the problem. The efficiency of the proposed algorithms is compared with each other. The results show that in small and medium size, the proposed method of benders decomposition algorithm shows the best results and performance. also in large size meta-heuristic algorithms proposed have good performance. Key Words: Collaborative Operating room scheduling, hospital networks with Virtual alliance, Benders decomposition, multi-objective learning variable neighborhood search algorithm.

فایل: ّFile: Download فایل