We study the problem of integrated staffing and scheduling under demand uncertainty. This
problem is formulated as a two-stage stochastic integer program with mixed-integer …

Nurse rostering is an NP-hard combinatorial problem which makes it extremely difficult to
efficiently solve real life problems due to their size and complexity. Usually real problem …

Abstract The Nurse Rostering Problem can be defined as assigning a series of shift
sequences (schedules) to several nurses over a planning horizon according to some …

We present a hybrid approach of goal programming and meta-heuristic search to find
compromise solutions for a difficult employee scheduling problem, ie nurse rostering with …

The Nurse Rostering Problem is an NP‐hard combinatorial optimization, scheduling
problem for assigning a set of nurses to shifts per day by considering both hard and soft …

We study a real-world problem arising from the operations of a hospital service provider,
which we term the master physician scheduling problem. It is a planning problem of …

This paper tackles a Nurse Scheduling Problem which consists of generating work
schedules for a set of nurses while considering their shift preferences and other …

This paper proposes a hybrid harmony search algorithm (HHSA) for solving the highly
constrained nurse rostering problem (NRP). The NRP is a combinatorial optimization …

In workforce scheduling for emergency medical services, it is important to ensure sufficient
coverage at all time. Thus, planning has to consider unpredictable employee absences. To …

In that work, they follow Hansen and Jaszkiewicz [1998], who considered the problem of
evaluating approximations to the true Pareto front. For that sake, they define a number of …