Operating theaters are considered as the most sensitive health department within hospital centers due to their significant cost/necessity for patients and their economic benefits for hospitals. In this paper, the authors consider patients that may require more than one surgery on the same day in the surgery scheduling problem which is a major technology enhancement in the health industry.
The surgery scheduling includes both the preoperative and the postoperative units of the operative stage. Two objectives are considered in a lexicographic way: the minimization of the makespan while prioritizing the patients having two surgeries and the total completion time to perform. An adapted tabu-search algorithm is used to tackles this NP-hard scheduling problem.
The proposed schedule is more relevant for operating theaters as it integrates all stages of the surgical procedure and considers patients with more than one operation during the same day.
This paper is original as it considers patients who need more than one operation, which responds to real challenge faced by decision-makers' in hospitals. The application of the time lags between stages of the surgical procedure generates a good utilization of the hospital resources and makes the scheduling task more flexible.
