Rostering from staffing levels: a branch-and-price approach

Abstract

Many rostering methods first create shifts from some given staffing levels, and after that create rosters from the set of created shifts. Although such a method has some nice properties, it also has some bad ones. In this paper we outline a method that creates rosters directly from staffing levels. We use a Branch-and-Price (B\&P) method to solve this rostering problem and compare it to an ILP formulation of the subclass of rostering problems studied in this paper. The two methods perform almost equally well. Branch-and-Price, though, turns out to be a far more flexible approach to solve rostering problems. It is not too hard to extend the Branch-and-Price model with extra rostering constraints. However, for ILP this is much harder, if not impossible. Next to this, the Branch-and-Price method is more open to improvements and hence, combined with the larger flexibility, we consider it better suited to create rosters directly from staffing levels in practice