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 and may have a different objective function, which has a priority over the overall objective function of the virtual distributed scheduling collaborative hospitals. So, the objective function of the problem is divided into two categories, but the overall objective function of the network is to reduce the cost of allocating patients to hospitals and surgeons, along with the cost of operating room overtime. In this study, to make the situation more realistic, the transshipment of the patient from one hospital to another is also taken into account. For this problem, a mixed-integer mathematical programming model is presented, and the Benders decomposition algorithm is designed. The efficiency of the algorithm was compared with experiments performed with the CPLEX solver, and finally, the results were reported. The results show that the proposed algorithm has good performance. Keywords: Operating room scheduling, Distributed systems, Collaborative planning, Virtual alliance, Benders decomposition Manuscript profile