Cyclic staff scheduling: optimization models for some real-life problems

Abstract

In this work, we propose a general integer programming model to address the staff scheduling problem, flexible enough to be easily adapted to a wide-range of real-world problems. The model is applied with slight changes to two case studies: a glass plant and a continuous care unit, and also to a collection of benchmark instances available in the literature. The emphasis of our approach is on a novel formulation of sequence constraints and also on workload balance, which is tackled through cyclic scheduling. Models are solved using the CPLEX solver. Computational results indicate that optimal solutions can be achieved within a reasonable amount of time.