A heuristic algorithm based on multi-assignment procedures for nurse scheduling
From MaRDI portal
(Redirected from Publication:475190)
Recommendations
- scientific article; zbMATH DE number 1175393
- A Novel Approach for the Nurse Scheduling Problem
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department
- A Pareto-based search methodology for multi-objective nurse scheduling
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- An estimation of distribution algorithm for nurse scheduling
Cites work
- scientific article; zbMATH DE number 2080236 (Why is no real title available?)
- A Pareto-based search methodology for multi-objective nurse scheduling
- A comparison of two approaches to nurse rostering problems
- A guide to vehicle routing heuristics
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Comparison and hybridization of crossover operators for the nurse scheduling problem
- Local search neighbourhoods for dealing with a novel nurse rostering model
- Nurse rostering problems -- a bibliographic survey.
- Primal-dual algorithms for the assignment problem
- The first international nurse rostering competition 2010
- The state of the art of nurse rostering
Cited in
(4)- A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department
- Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
- A Pareto-based search methodology for multi-objective nurse scheduling
This page was built for publication: A heuristic algorithm based on multi-assignment procedures for nurse scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475190)
