A heuristic algorithm based on multi-assignment procedures for nurse scheduling
From MaRDI portal
Publication:475190
DOI10.1007/s10479-013-1357-9zbMath1301.90033MaRDI QIDQ475190
Dario Landa-Silva, Everton Luiz De Melo, Douglas Baroni Rizzato, Ademir Aparecido Constantino, Wesley Romão, Candido Ferreira Xavier De Mendonça
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/31328/
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
Uses Software
Cites Work
- Unnamed Item
- The first international nurse rostering competition 2010
- Comparison and hybridization of crossover operators for the nurse scheduling problem
- Primal-dual algorithms for the assignment problem
- Nurse rostering problems -- a bibliographic survey.
- A Pareto-based search methodology for multi-objective nurse scheduling
- Local search neighbourhoods for dealing with a novel nurse rostering model
- A comparison of two approaches to nurse rostering problems
- The state of the art of nurse rostering
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A guide to vehicle routing heuristics