This paper presents a review of the literature on personnel scheduling problems. Firstly, we
discuss the classification methods in former review papers. Secondly, we evaluate the …

This work presents integer programming techniques to tackle the problem of the
International Nurse Rostering Competition. Starting from a compact and monolithic …

This paper presents an adaptive neighborhood search method (ANS) for solving the nurse
rostering problem proposed for the First International Nurse Rostering Competition (INRC …

In this paper, we are addressing the NP-hard nurse rostering problem utilizing a 2-stage
approach. In stage one, Monte Carlo Tree Search (MCTS) and Hill Climbing (HC) are …

This contribution presents a two-phase variable neighborhood search algorithm for solving
nurse rostering problems. In order to demonstrate the efficiency of the proposed algorithm, it …

Nurse rostering is a complex and hard discrete optimization problem as well as a very
common personnel scheduling task which occurs in each hospital ward. To solve the highly …

This paper presents an integer programming model and a matheuristic for the physician
rostering problem. Constraints related to physician's preferences, legal restrictions, hospital …

This study provides a new hyper-heuristic design using a learning-based heuristic selection
mechanism together with an adaptive move acceptance criterion. The selection process was …

Nurse rostering is an attractive research domain due to its societal relevance, while
academics are intrigued by its combinatorial complexity. Descriptions of nurse rostering …

Interactive reoptimization is an approach for progressively adjusting a candidate solution in
order to introduce aspects of a problem that have not been entirely captured by the …