A component-based heuristic search method with evolutionary eliminations for hospital personnel scheduling

DOI10.1287/IJOC.1080.0298MaRDI QIDQ2901079zbMATHOpenAlexFDO

Authors Uwe Aickelin, Edmund K. Burke, Jingpeng Li

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL http://eprints.nottingham.ac.uk/34111/

zbMATH Keywords

local searchnurse rosteringconstructive heuristicevolutionary elimination

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• The state of the art of nurse rostering
• Simulated annealing approach to nurse rostering benchmark and real-world instances
• A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
• Constructing nurse schedules at large hospitals
• Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem

Cited in

(2)

• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
• Workforce planning incorporating skills: state of the art

This page was built for publication: A component-based heuristic search method with evolutionary eliminations for hospital personnel scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901079)