Operations research problem, paradigm of constrained scheduling problems
The nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions.[1] Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields.[2][3]
While research on computer-assisted employee scheduling goes back to the 1950s,[4] the nurse scheduling problem in its current form was introduced in two parallel publications in 1976.[5][6] It is known to have NP-hard complexity.[1]