A greedy-based neighborhood search approach to a nurse rostering problem
2004
European Journal of Operational Research
1
153
28-40
Journal_Article
Intensive_Care_Units||Personnel_Planning_and_Scheduling
Algorithms_Heuristics
Tactical||Operational_Offline
No
No
Article Link
Bellanti, F. C., G.; Della Croce, F.; Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. [Journal Article]. European Journal of Operational Research, 153(1), 28-40.
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is considered. The nurse rostering problem is a typical employee timetabling problem, where each month it is required to generate the nursing staff shifts subject to various contractual and operational requirements. These requirements may be in conflict especially for those months in which manpower is reduced due to seasonal holidays. It is required to consider both holidays planning and parametric contractual constraints, but no cyclic schedules and corresponding weekly patterns. A local search approach is introduced which is based on a neighborhood operating on partial solutions completed by means of a greedy procedure so as to avoid the generation of infeasible solutions. Both a tabu search procedure and an iterated local search procedure are proposed. The solutions computed by the proposed procedures compare well with respect to a straightforward lower bound and strongly outperform those manually generated in the hospital ward. The proposed approach is now currently used on site.