In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the...

This research aims to build a feasible and efficient operating program for an endoscopy centre composed of two specialised operating rooms for one week, with the objective of both maximising the utilisation of the operating room and minimising the cost of overtime. First, a tactical planning...