Insights on the exact resolution of the rostering problem

Abstract

The purpose of this paper is to present some findings on the rostering problem resolution through the analysis of a real case study. The problem is initially formulated as a mixed integer problem (MIP) and solved with CPLEX, using the ILOG OPL Studio environment. The achieved findings and results are the basis for the development of a constructive heuristic that consistently reaches a feasible solution, which is the optimal solution in this particular case, in a shorter period of time than the MIP model.