Weight Calculator for Graphical Presentation of Nurse Rostering

Abstract

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. The nurse scheduling problem involves the assignment of shifts and holidays to nurses. Each nurse has their own wishes and restrictions, as does the hospital. The problem is described as finding a schedule that satisfies not only the constraints of the nurses available but also the requirements of the hospital. Conventionally, a nurse can work 3 shifts because nursing is shift viz: day shift, night shift, late night shift. After reviewing various literature, researcher observed that, It is tedious task for hospital authority to allocate nurses to appropriate jobs by considering the parameters like duty time (full time or part time), expertise or nurse’s skill, willingness to work in multiple shifts and their mental health. So we try to allocate proper duties to available nurses using big graph and if any other proper solution is there.