Nurse preference rostering using agents and iterated local search
From MaRDI portal
Publication:2341228
DOI10.1007/s10479-014-1701-8zbMath1309.90029OpenAlexW2089367420MaRDI QIDQ2341228
Jeffery K. Cochran, David Caswell, Michael Chiaramonte
Publication date: 23 April 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1701-8
staff schedulingnurse rosteringiterated local searchnurse schedulingagent schedulingagent programming
Cites Work
- Multiagent system simulations of treasury auctions
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
- Local search neighbourhoods for dealing with a novel nurse rostering model
- A 0-1 goal programming model for nurse scheduling
- A simulated-annealing heuristic for shift scheduling using non-continuously available employees
- Preference scheduling for nurses using column generation
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital