Ant Colony Algorithm for Surgery Scheduling Problem

A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints

“…(27), where G c is the available set of resources for the next resource node stage selection as shown in Eq. (18).…”

“…An individual surgery has its own required mode to make the solution closer to the actual surgical procedure. Our pilot research [17,18] represented the surgery scheduling problem as an extended multi-resource constrained flexible job-shop scheduling problem and proposed a modified ant colony algorithm to solve it. The multiple resources covered include all major resources involved in a complete surgery stages.…”

“…The nodes on the surgery graph represent the surgeries, and the directional arcs, indicating the precedence sequence, are used to link two nodes. Therefore, the ant foraging path is the scheduling sequence of the surgeries [17,18]. The inner level graph (Fig.…”

“…(18) indicates that the pheromone update involves three parts. The first part (1 − ) × ii denotes the pheromone value after evaporation, where denotes the pheromone evaporation rate.…”

Pareto Set-based Ant Colony Optimization for Multi-Objective Surgery Scheduling Problem

“…The nodes in the surgery graph represent the surgeries, and the directional arc indicates the precedence sequence. The ant foraging path is the scheduling sequence of the surgeries [12]. The inner level graph is defined as resources graph.…”