This paper describes our experience with a simple modeling and programming approach for increasing the amount of constraint propagation in the constraint solving process. The idea, although similar to redundant constraints, is based on the concept of redundant modeling. We introduce the notions of CSP model and model redundancy, and show how mutually redundant models can be combined and connect...

We investigate the applicability of an existing framework for algorithm runtime prediction to the field of metaheuristics, in particular applied to the real world problem of nurse rostering. Apart from predicting the runtime, we look at other performance criteria as well. These so called empirical hardness models are based on readily computable features of the problem instances. These problem f...

One intricate computational problem still researched today is the Nurse Rostering Problem. Most literature presents different solutions to the local problem, but in recent years the concept of problem decomposition was identified as one way to improve performance. The downside of this is that the quality of separate rosters is much lower than that of a central solution, where personnel can be s...

The Nurse Scheduling Problem can be simply defined as assigning a series of shift sequences (schedules) to several nurses over a planning horizon according to some constraints and preferences. The inherent benefits of having higher-quality and more flexible schedules are a reduction in outsourcing costs and an increase of job satisfaction in health organizations. In this paper, we present a nov...

The Nurse Scheduling Problem can be simply defined as assigning a series of shift sequences (schedules) to several nurses over a planning horizon according to some constraints and preferences. The inherent benefits of having higher-quality and more flexible schedules are a reduction in outsourcing costs and an increase of job satisfaction in health organizations. In this paper, we present a nov...

Objective: The purpose of this study was to gain insight into nurse managers’ stress experiences and coping strategies in order to better support them. Design: A qualitative exploratory descriptive research design was used in this study. Subject: Fifteen nurse managers participated in this study. Results: Three descriptive themes related to nurse managers’ occupational stress were identified: r...

The problem addressed in this paper is the integrated vehicle-crew-rostering problem (VCRP) aiming to define the schedules for the buses and the rosters for the drivers of a public transit company. The VCRP is described by a bi-objective mixed binary linear programming model with one objective function aggregating vehicle and crew scheduling costs and the other the rostering features. The VCRP ...

In this paper, we present a novel meta-heuristic technique for the nurse scheduling problem (NSP). This well-known scheduling problem assigns nurses to shifts per day taking both hard and soft constraints into account. The objective is to maximize the preferences of the nurses and to minimize the total penalty cost from violations of the soft constraints. The problem is known to be NP-hard. Due...

A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurse’s assignment. Unlike our previous work that used GAs to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. eventually, we will be able to identify and mix building blocks directly. The Bayesian optimizati...

The integrated vehicle-crew-roster problem with days-off pattern aims to simultaneously determine minimum cost vehicle and daily crew schedules that cover all timetabled trips and a minimum cost roster covering all daily crew duties according to a pre-defined days-off pattern. This problem is formulated as a new integer linear programming model and is solved by a heuristic approach based on Ben...