Sharif Digital Repository

Here, we explain an algorithm, recently introduced in the literature, for the personalized nurse scheduling problem. In this algorithm the authors focus on the deterministic counterpart of the specific problem that has been described in the second international nurse rostering competition. One specificity of this version is that most constraints are soft, meaning that they can be violated at the price of a penalty. The problem is modeled as an integer program (IP) and is solved using a branch-and-price procedure. In this model, each column of the IP corresponds to a rotation, i.e., a sequence of consecutive working days for a nurse. In contrast, classical models involve individual nurse...