Research On Bi-objective Operating Room Scheduling Problem Considering Incompatibility

The concept of the first-level diagnosis and grading diagnosis and treatment at the grassroots level promoted the integration of medical services and high-quality resources to the grassroots level.How to further improve the allocation efficiency of medical resources in primary hospitals from the perspective of operational management and operational research is a research direction that researchers pay attention to.The operating room is the most intensive medical resource in the hospital.Regardless of the operating room of any grade hospital,the operating room requirements ensure a clean and comfortable operating environment for patients.Therefore,this thesis conducts research on the limited medical resources in the primary hospitals,the shortage of operating room resources,and the low utilization rate of the operating room.The main research contents are as follows:(1)According to the results of literature and model research,the operating room scheduling problem can be transformed into the Multi-Vehicle Travelling Purchaser Problem(MVTPP).The bi-objective integer programming model of the operating room scheduling problem is constructed according to the parameters of the MVTPP.On the one hand,the requirements of different types of surgery for the cleansing of the operating room are different.In principle,different types of surgeries are not allowed to be arranged in the same type of operating room.On the other hand,considering the frequent adjustments of medical equipment would cause loss,it is necessary to reduce the switches of different types of surgery.Therefore,the model aims to minimize the time to complete all surgeries and the number of surgical switches.(2)Considering that the exact algorithm is not suitable for solving large-scale instances,a heuristic algorithm is designed to solve the problem by combining simulated annealing algorithm and k-opt algorithm.The efficiency and effectiveness of results are determined by the parameters of the algorithm.It is necessary to analyze the sensitivity of the algorithm,test the operation of the algorithm under different algorithm parameters,find the optimal parameter combination within a certain parameter range,and provide the research basis for the subsequent chapters.(3)Referring to the data sets and result criteria of two related literatures,the data set in the reference literature is run by the algorithm proposed in this thesis.The comparison of examples are carried out,and the optimal path results are shown by figures.The results show that the accuracy of the proposed algorithm is better than that of the reference algorithm when solving the same problem model,and the deviation from exact solution is within the acceptable range.(4)A case study is carried out based on medical data from a primary hospital,including the type of surgery,estimated time of surgery,and actual error.The operation time is predicted by Monte Carlo method,and the operation is assigned to the operation room with different cleanliness according to the type of surgery.For the operation in the decision pool,different sorting methods are used to obtain and compare the scheduling results,so that the best operating room scheduling scheme is selected.The feasibility of transforming the operating room scheduling problem into MVTPP is verified,and the effectiveness of the proposed algorithm in solving the inoperable operating room scheduling problem is analyzed.In this thesis,the MVTPP and its solving methods are applied to the medical problem reasonably,and the bi-objective integer programming model is constructed.The combinatorial optimization algorithm is applied to solve the incompatibility problem.After the sensitivity analysis and the comparison of the examples are completed,the case analysis of the operating room scheduling schedule under real medical conditions.is given.The research of the thesis has a high theoretical and practical value.