Paper Title
Layered Constraint Satisfying (LCS) Method for Nurse Rostering Problem

In this paper layered constraint satisfying (LCS) method is proposed to solve nurse rostering problem which is one of the crucial problem required to be address in many hospitals. The problem is taken to schedule 36 nurses for early, day, late and night shifts depending upon the availability of nurses and demand by the hospital. LCS method works by forming different layer for each nurse depending on their availability day wise per week. All the layers are overlapped to get supply matrix of nurses and these information is further used to satisfy different hard and soft constraints. The results reveal that the method is capable to solve the nurse rostering problems by satisfying the specified constraints. Keywords - nurse rostering problem, layered constraint satisfying method