Search

The nurse scheduling problem (NSP) has been a crucial and challenging research issue for hospitals, especially considering the serious deterioration in nursing shortages in recent years owing to long working hours, considerable work pressure, and irregular lifestyle, which are important in the service industry. This study investigates the NSP that aims to maximize nurse satisfaction with the generated schedule subject to government laws, internal regulations of hospitals, doctor-nurse pairing rules, shift and day off preferences of nurses, etc. The computational experiment results show that our proposed hybrid metaheuristic outperforms other metaheuristics and manual scheduling in terms of both computation time and solution quality. The presented solution procedure is implemented in a real-world clinic, which is used as a case study. The developed scheduling technique reduced the time spent on scheduling by 93% and increased the satisfaction of the schedule by 21%, which further enhanced the operating efficiency and service quality. [ABSTRACT FROM AUTHOR]