A variable neighborhood search based matheuristic for nurse rostering problems
From MaRDI portal
(Redirected from Publication:475191)
Recommendations
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A greedy-based neighborhood search approach to a nurse rostering problem.
Cites work
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A matheuristic approach for the two-machine total completion time flow shop problem
- An annotated bibliography of personnel scheduling and rostering
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Local branching
- Nurse Scheduling Using Mathematical Programming
- Nurse rostering problems -- a bibliographic survey.
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Staff scheduling and rostering: a review of applications, methods and models.
- The state of the art of nurse rostering
- Variable neighborhood search
- Variable neighborhood search and local branching
- Variable neighborhood search: Principles and applications
Cited in
(24)- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- 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 greedy-based neighborhood search approach to a nurse rostering problem.
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- A simple and effective algorithm for the maximum happy vertices problem
- Local search neighbourhoods for dealing with a novel nurse rostering model
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
- 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
- Staff assignment with lexicographically ordered acceptance levels
- A matheuristic approach for the two-machine total completion time flow shop problem
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping
This page was built for publication: A variable neighborhood search based matheuristic for nurse rostering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475191)
