Optimization of Static Patient Admission Scheduling using the Variable Neighborhood Search Method

Abstract

Planning and resource management are important aspects of a company's operational sustainability. With good management, companies can achieve their targets while minimizing operational costs. The same goes for hospitals. Various challenges related to resources are experienced by hospitals, such as scheduling nurses, patient surgeries, and patient appointments. Therefore, this paper aim at optimizing patient admission scheduling in order to improve hospital resource efficiency. To be more specific, patient admission scheduling, also known as the Patient Admission Scheduling Problem (PASP), is a scheduling problem that considers patient preferences and needs, bed availability, resource efficiency, and utilization. This problem is highly relevant, especially for large hospitals. The number of rooms, specialists, and facilities makes manual scheduling extremely difficult. It is due to the varied preferences, needs, and lengths of stay for patients in hospital. Various methods, both heuristic and exact, have been proposed, including the use of integer programming methods. However, for a large search space, this method requires a very long computational time. To address the PASP, this study applies the Variable Neighborhood Search (VNS) algorithm and random selection as optimization algorithms. The method was chosen because it has been proven effective to solve some combinatorial optimization problems in prior studies. Seven types of neighborhoods are implemented to find the best combinations in optimizing the PASP. The results show that the VNS algorithm outperforms the random selection algorithm, as it is able to generate 5 out of 7 solutions that are better, reducing penalties by 27.84% to 55.29%. The expected impact of this study is to increase the hospital patient satisfaction whereas in the same time minimize the operational cost.