Surgical case scheduling is a key issue in the field of medician, which is a challenging work because of the difficulty in assigning resources to patients. This study regards the surgical case scheduling problem as a flexible job shop scheduling problem (FJSP). Considering the switching and preparation time of patients in different stage, an improved multi-objective imperialist competitive algorithm (IMOICA), which adopts the non-dominant sorting method, is proposed to optimize the whole scheduling. First, the social hierarchy strategy is developed to initialize the empire. Then, to enhance the global search ability of the algorithm, the concept of attraction and repulsion (AR) is introduced into the assimilation strategy. Moreover, to increase the diversity of the population, the revolution strategy is utilized. Finally, the variable neighborhood search (VNS) strategy is embedded to improve its exploitation capacity further. Experiments show that scheduling in advance saves time and cost, and IMOICA can solve the surgical case scheduling problem studied efficiently.
Keywords: Imperialist competitive algorithm; Surgical case scheduling; Variable neighborhood search strategy.
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.