A Bi-Objective Paediatric Operating Theater Scheduling

A Bi-Objective Paediatric Operating Theater Scheduling

Latifa Dekhici, Khaled Belkadi
DOI: 10.4018/IJHISI.323451
Article PDF Download
Open access articles are freely available for download

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.
Article Preview
Top

State Of The Art And Contribution

The planning and scheduling literature covers a wide range of research methods from management and operational research that involve a combination of analysis and solution/technical evaluation.

The scheduling of surgical operations has been a topic of interest in the literature for several decades. In the past, researchers have focused on developing scheduling algorithms for single objective optimization, such as minimizing the total completion time or maximizing the utilization of resources.

More recently, there has been a growing interest in addressing the complexities inherent in the scheduling of surgeries by considering multiple objectives. Balas et al. (2015) proposed a multi-objective optimization model for scheduling surgeries that takes into account both patient waiting time and surgeon workload. Similarly, Anwar et al. (2017) presented a bi-objective optimization model for the scheduling of surgeries that balances the surgeon’s workload and patient waiting time.

In addition to considering multiple objectives, researchers have also started to address the constraints and complexities of the operating room environment. For instance, Ahmed et al., (2020) proposed a scheduling algorithm for the operating room that considers surgeon preferences, availability, and patient priority.

Several metaheuristics algorithms, such as genetic algorithms and simulated annealing, have also been applied to the surgical scheduling problem (Lin et al., 2023). The scheduling of surgical procedures continues to be a topic of interest among academic researchers (Eshghali et al.,2023; Wang et al., 2022).

Most papers focus on time constraints such as the opening period of the room, the available period for each time slot, and the average waiting time. Few studies take into account constraints such as priority by age, assignment laws, and room specialization, and even fewer consider the impact of budget and program feasibility. To our knowledge, few studies take into account constraints such as priority by age (Cardoen et al., 2009), assignment laws and rooms specialization respect (Sier et al., 1997). In (Saadani et al., 2006), the authors describe the problem as a three stages hybrid flow shop (HFS) taking into account the stretcher bearers.

The objectives of surgery scheduling are diverse and can include perioperative variable costs (Dexter et al., 2002), hospitalization cost (Colin, 2000) and the need for instruments (Kumar & Shim, 2006). As for operating theater multi-objective scheduling, it was proposed in (Cardoen et al., 2009) and (Lust & Meskens, 2012). Meanwhile in (Lust & Meskens, 2012), the authors assume that the number of awakening beds has no impact, and the day is divided into 20-minute intervals. They also minimize objectives related to operating room opening and nurses' specialties and affinities, which can be optimized at a medium-term level.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 2 Issues (2022)
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing