The Robust Nurse Scheduling Problem

The scheduling and assignment of nurses is a crucial problem in hospitals. It requires a good scheduling to ensure the minimization of overall hospital costs and to take into consideration the preferences of the nurses. In this study, we present a new mathematical formulation for the nurse scheduling problem (NSP) where we integrate some new constraints. In addition to the deterministic model, we also propose the robust counterpart for dealing with uncertainties using the worst case criterion. The solution approach and a real application will be the subject of a future work.