Local search neighbourhoods for dealing with a novel nurse rostering model
From MaRDI portal
Publication:1761887
DOI10.1007/s10479-010-0804-0zbMath1251.90116OpenAlexW1978831829MaRDI QIDQ1761887
Benoît Rossie, Burak Bilgin, Patrick de Causmaecker
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0804-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
A flexible mixed integer programming-based system for real-world nurse rostering ⋮ Workforce planning incorporating skills: state of the art ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ Optimizing cost-effectiveness in a stochastic Markov manpower planning system under control by recruitment ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ Staff scheduling in blood collection problems ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ A heuristic algorithm based on multi-assignment procedures for nurse scheduling ⋮ Modelling and evaluation issues in nurse rostering ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ Personnel scheduling: models and complexity ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ Nurse preference rostering using agents and iterated local search ⋮ HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM ⋮ The roster quality staffing problem -- a methodology for improving the roster quality by modifying the personnel structure
Uses Software
Cites Work
- Polynomially solvable personnel rostering problems
- A general heuristic for vehicle routing problems
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Comparison and hybridization of crossover operators for the nurse scheduling problem
- The nurse rostering problem: a critical appraisal of the problem structure
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A comparison of two approaches to nurse rostering problems
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- The state of the art of nurse rostering
- On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
- An estimation of distribution algorithm for nurse scheduling
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Variable Neighborhood Search
- A memetic approach to the nurse rostering problem
This page was built for publication: Local search neighbourhoods for dealing with a novel nurse rostering model
