A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
DOI10.3390/a6020278zbMath1461.90194OpenAlexW2014029878MaRDI QIDQ1736555
Ioannis P. Solos, Grigorios N. Beligiannis, Ioannis X. Tassopoulos
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6020278
costnurse rosteringhospital personnel schedulingtwo-phase algorithmmutation elementreduce Rostersstochastic variable neighborhoodswap selective mutation
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Cites Work
- An evolutionary approach for the nurse rerostering problem
- Variable neighbourhood search: methods and applications
- Hybrid variable neighbourhood approaches to university exam timetabling
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A variable neighborhood search for graph coloring.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- An indirect genetic algorithm for a nurse-scheduling problem
- Variable neighborhood decomposition search
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- Personnel scheduling: a literature review
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- The state of the art of nurse rostering
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
This page was built for publication: A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem