Solving the planning and scheduling problem simultaneously in a hospital with a bi-layer discrete particle swarm optimization

The operating room is one of the most capital-intensive resources for a hospital. To achieve further improvements and to restrict cost increases, hospitals may need to operate more efficiently with the resources they already possess. The paper considers the joint problem of planning and scheduling patients in operating rooms on an operational level (weekly basis) with two objectives: maximizing the overall patients' satisfaction and minimizing the cost of overtime in operating rooms as well as the daily cost of operating rooms and recovery beds, which is NP-hard. The decision problem is solved using a bi-layer discrete particle swarm optimization, introducing a repair mechanism for infeasible solutions, specific operators like crossover, insertion and exchange. Moreover, a gap finding scheduling heuristic is designed to solve the surgical case sequencing problem. We first compare the performance of the proposed solution method to that of Fei et al. for three instances separately, using data of a Chinese hospital. Next, the efficient Pareto solutions for the joint problem are presented. The results show that the bi-layer discrete particle swarm optimization can solve the operating room scheduling efficiently and effectively.