A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
From MaRDI portal
Publication:1983752
DOI10.3934/jimo.2020058zbMath1476.90106OpenAlexW3012931649MaRDI QIDQ1983752
Mohammed Abdelghany, Kazuhide Nakata, Amr B. Eltawil, Zakaria Yahia
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020058
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Cites Work
- Integer programming techniques for the nurse rostering problem
- Polynomially solvable personnel 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
- The first international nurse rostering competition 2010
- A dynamic programming based heuristic for the assembly line balancing problem
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- The second international nurse rostering competition
- Integer programming model extensions for a multi-stage nurse rostering problem
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Personnel scheduling: a literature review
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- New approaches to nurse rostering benchmark instances
This page was built for publication: A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
