Local search neighbourhoods for dealing with a novel nurse rostering model
From MaRDI portal
Publication:1761887
DOI10.1007/S10479-010-0804-0zbMATH Open1251.90116OpenAlexW1978831829MaRDI QIDQ1761887FDOQ1761887
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
Recommendations
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A variable neighborhood search based matheuristic for nurse rostering problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A general heuristic for vehicle routing problems
- The nurse rostering problem: a critical appraisal of the problem structure
- 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
- Variable Neighborhood Search
- Polynomially solvable personnel rostering problems
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A memetic approach to the nurse rostering problem
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Comparison and hybridization of crossover operators for the nurse scheduling problem
- A comparison of two approaches to nurse rostering problems
- An estimation of distribution algorithm for nurse scheduling
Cited In (17)
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- Nurse preference rostering using agents and iterated local search
- Integrating micro-depot freight transport in existing public transport services
- Workforce planning incorporating skills: state of the art
- Title not available (Why is that?)
- Modelling and evaluation issues in nurse rostering
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- Personnel scheduling: models and complexity
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department
- A heuristic algorithm based on multi-assignment procedures for nurse scheduling
- A flexible mixed integer programming-based system for real-world nurse rostering
- Optimizing cost-effectiveness in a stochastic Markov manpower planning system under control by recruitment
- A greedy-based neighborhood search approach to a nurse rostering problem.
- Shift rostering using decomposition: assign weekend shifts first
- Staff scheduling in blood collection problems
- 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
This page was built for publication: Local search neighbourhoods for dealing with a novel nurse rostering model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761887)
