Scheduling
M. Hamid; R. Tavakkoli-Moghaddam; B. Vahedi-Nouri; H. Arbabi
Abstract
Operating rooms (ORs) are among the most influential departments of a hospital that a major portion of its expenditures and revenues originate from it. Due to the limited resources and the presence of different stockholders, effective management, and the optimal planning of this department are challenging. ...
Read More
Operating rooms (ORs) are among the most influential departments of a hospital that a major portion of its expenditures and revenues originate from it. Due to the limited resources and the presence of different stockholders, effective management, and the optimal planning of this department are challenging. This paper develops a mathematical model to address the integrated problem of the operating room and surgical member scheduling with the objective of makespan minimization. In the proposed model, several aspects, including the availability and necessity of surgical members and equipment, and lunch break consideration, are incorporated. Finally, a case study related to an OR department in a general hospital is provided to assess the applicability and performance of the proposed model.
Mathematical modelling
M. Bakhshi; S. E. Hashemi; H. Dezhdar
Abstract
In this research, we present a mathematical model for allocating people to different jobs and shifting employees between related jobs. This action will reduce the repetitive activities workload and ergonomic risks at the planned time horizon, and finally increases the organization's efficiency. In this ...
Read More
In this research, we present a mathematical model for allocating people to different jobs and shifting employees between related jobs. This action will reduce the repetitive activities workload and ergonomic risks at the planned time horizon, and finally increases the organization's efficiency. In this proposed model, the devices are semi-automatic and it is possible to allocated more than one task to one person. Regarding the modeling and the case study of the constraints, it is shown that the complexity of this problem type is NP-Hard, and the result of accurate methods for solving the problem is not possible in a reasonable time. Due to this Simulated Annealing (SA) algorithm is used to study the proposed model and comparison of the results of SA algorithm with the results of precise optimization methods shows the better performance of the Simulated Annealing algorithm in terms of the time and answer quality.
