An evolutionary approach for the nurse rerostering problem

From MaRDI portal
Publication:632687

DOI10.1016/j.cor.2010.12.012zbMath1208.90096OpenAlexW2081234605MaRDI QIDQ632687

Mario Vanhoucke, Broos Maenhout

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.012




Related Items (17)

A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rosteringA novel approach for nurse rerostering based on a parallel algorithmA two-phase adaptive variable neighborhood approach for nurse rosteringA learning large neighborhood search for the staff rerostering problemA diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rosteringReal-time personnel re-scheduling after a minor disruption in the retail industryFair shift change penalization scheme for nurse rescheduling problemsThe nurse rerostering problem: strategies for reconstructing disrupted schedulesA tribute to Ivan KiguradzeA generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problemA survey on the applications of variable neighborhood search algorithm in healthcare managementAn exact approach for the personnel task rescheduling problem with task retimingA perturbation matheuristic for the integrated personnel shift and task re-scheduling problemFinding good nurse duty schedules: a case studyThe re-planning and scheduling of surgical cases in the operating room department after block release time with resource reschedulingThe focal boundary value problem for strongly singular higher-order nonlinear functional-differential equationsReal-time bi-objective personnel re-scheduling in the retail industry


Uses Software


Cites Work


This page was built for publication: An evolutionary approach for the nurse rerostering problem