Abstract. Nurse scheduling problem (NSP) has been a subject that is being studied broadly by both academician and practitioners, over the years. Nurse scheduling concepts are varied due to sophisticated and challenging real world scenarios in nurse management system. Moreover, the importance of solving nurse scheduling problems has triggered various approaches or techniques to solve these scheduling problems. In order to develop a good nurse scheduling model, it is crucial to comprehend the problem and the characteristics of the potential techniques so as to cope with the complex scheduling problem. Hence, the main purpose of this paper is to provide a rich literature on the diverse recent solution techniques in the NSP. Subsequently, an evolutionary trend of nurse scheduling models is identified as fruitful and thus, future directions of the scheduling technique are discussed. Finally, a potential algorithm is proposed to solve a nurse scheduling problem.
Stored only when both papers are in the corpus — 59 citations exist upstream.
Imported from OpenAlex (CC0) — nothing here is generated.