A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems

DOI10.1016/j.ejor.2016.09.030zbMath1394.90300OpenAlexW2523385593MaRDI QIDQ1751653

Xianqiang Yang

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/58402/

zbMATH Keywords

integer programmingtimetablingnurse rosteringhybrid algorithmvariable neighbourhood Search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70)

Related Items (12)

A flexible mixed integer programming-based system for real-world nurse rostering ⋮ A hybrid integer and constraint programming approach to solve nurse rostering problems ⋮ E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles ⋮ 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 ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ Recent advances in selection hyper-heuristics ⋮ A variable neighborhood search algorithm for an integrated physician planning and scheduling problem ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ A graph-based formulation for the shift rostering problem ⋮ A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties

Uses Software

• Paramils
• CPLEX
• Gurobi
• HIBISCUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A systematic two phase approach for the nurse rostering problem
• A variable neighborhood search based matheuristic for nurse rostering problems
• The first international nurse rostering competition 2010
• A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
• Scheduling staff using mixed integer programming
• Staff scheduling and rostering: a review of applications, methods and models.
• An indirect genetic algorithm for a nurse-scheduling problem
• An annotated bibliography of personnel scheduling and rostering
• On the complexity of manpower shift scheduling
• The state of the art of nurse rostering
• New approaches to nurse rostering benchmark instances
• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
• A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
• Solving a nurse scheduling problem with knapsacks, networks and tabu search
• ParamILS: An Automatic Algorithm Configuration Framework
• Handbook of metaheuristics
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications

This page was built for publication: A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems