The surgical case scheduling problem with fuzzy duration time: An ant system algorithm

In this paper, we address the surgical case scheduling problem in multioperating theater environment with uncertain service times in order to minimize makespan. In surgical case scheduling, not only the hospital resources are allocated to surgical cases, but also the start time of performing surgeries is determined based on a sequence of cases in a short-term time horizon. We consider fuzzy numbers for duration times of all stages and hereafter, the problem is called fuzzy surgical case scheduling. Since the operational environment in the problem is similar to no-wait multi-resource fuzzy exible job shop problem, we consider constraints of the latter for formulating and solving the problem. This problem is strongly an NP-hard optimization problem, hence we employ ant system algorithm to tackle it. The proposed approach is illustrated by detailed examples of three test cases and numerical computational experiments. The performance of the proposed algorithm is compared with a schedule constructed by rst-come-rst-service rule in all test instances. Also, a real case is provided from a hospital in Isfahan to evaluate the proposed algorithm. The computational experiments state that the algorithm outperforms hospital planning as well as fuzzy rule, indicating eciency and capability of the algorithm for optimizing the makespan.