A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
From MaRDI portal
(Redirected from Publication:1983752)
Recommendations
- A new two-stage variable neighborhood search algorithm for the nurse rostering problem
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Simulated annealing approach to nurse rostering benchmark and real-world instances
Cites work
- A dynamic programming based heuristic for the assembly line balancing problem
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- 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 hybrid integer and constraint programming approach to solve nurse rostering problems
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A particle swarm optimization approach with refinement procedure for nurse rostering problem
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A variable neighborhood search based matheuristic for nurse rostering problems
- Integer programming model extensions for a multi-stage nurse rostering problem
- Integer programming techniques for the nurse rostering problem
- New approaches to nurse rostering benchmark instances
- Personnel scheduling: a literature review
- Polynomially solvable personnel rostering problems
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- The first international nurse rostering competition 2010
- The second international nurse rostering competition
- Variable neighborhood search accelerated column generation for the nurse rostering problem
Cited in
(11)- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
- A variable neighborhood search based matheuristic for nurse rostering problems
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A new two-stage variable neighborhood search algorithm for the nurse rostering problem
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
This page was built for publication: A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983752)
