A variable neighborhood search based matheuristic for nurse rostering problems
From MaRDI portal
Publication:475191
DOI10.1007/s10479-012-1235-xzbMath1301.90055OpenAlexW1998116230MaRDI QIDQ475191
Fabio Salassa, Frederico Della Croce
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1235-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A simple and effective algorithm for the maximum happy vertices problem ⋮ Genetic based discrete particle swarm optimization for elderly day care center timetabling ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ The second international nurse rostering competition ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ An integer programming approach for the physician rostering problem ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders ⋮ Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation
Cites Work
- A matheuristic approach for the two-machine total completion time flow shop problem
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Variable neighborhood search
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- Local branching
- An annotated bibliography of personnel scheduling and rostering
- The state of the art of nurse rostering
- Variable neighborhood search and local branching
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Nurse Scheduling Using Mathematical Programming
- Variable neighborhood search: Principles and applications
This page was built for publication: A variable neighborhood search based matheuristic for nurse rostering problems
