A Bi-Objective Paediatric Operating Theater Scheduling

Abstract

In this paper, a bi- objective Operating Theater scheduling is proposed. The problem is subject to order and assignment constraints. The first objective is the minimization of the operating theater opening total time also called makespan in manufacturing systems while the second is to maximize constraints satisfaction. The scheduling problem is considered as a two-stage hybrid flow shop with blocking. Several metaheuristics are compared: the firefly algorithm, bats algorithm, particles swarm optimization and local search. In addition to the care specific qualitative and quantitative parameters, the average deviation from the lower bound is used in order to confirm the effectiveness of the methods. The implementation is done on the operating theater of the paediatric hospital of Oran when it is properly and improperly sized.