A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
From MaRDI portal
Publication:1046124
DOI10.1016/j.ejor.2009.07.036zbMath1177.90356OpenAlexW2029745941MaRDI QIDQ1046124
Jingpeng Li, Rong Qu, Edmund Kieran Burke
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.036
Related Items (31)
A flexible mixed integer programming-based system for real-world nurse rostering ⋮ Integer programming techniques for the nurse rostering problem ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ A variable neighborhood search algorithm for the surgery tactical planning problem ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ On a timetabling problem in the health care system ⋮ A systematic two phase approach for the nurse rostering problem ⋮ Physician Staffing for Emergency Departments with Time-Varying Demand ⋮ A variable neighborhood search based matheuristic for nurse rostering problems ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ Integer programming model extensions for a multi-stage nurse rostering problem ⋮ A constructive heuristic for staff scheduling in the Glass industry ⋮ A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering 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 ⋮ An integer programming approach for the physician rostering problem ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ New approaches to nurse rostering benchmark instances ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ An MIP model to schedule the call center workforce and organize the breaks ⋮ The nurse rostering problem: a critical appraisal of the problem structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling staff using mixed integer programming
- Variable neighborhood search
- A subproblem-centric model and approach to the nurse scheduling problem
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- An indirect genetic algorithm for a nurse-scheduling problem
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Multicriteria optimization
- A distributed genetic algorithm for deterministic and stochastic labor scheduling problems
- Preference scheduling for nurses using column generation
- The state of the art of nurse rostering
- An estimation of distribution algorithm for nurse scheduling
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Search Methodologies
- On Manpower Scheduling Algorithms
- A simulated annealing approach to the cyclic staff-scheduling problem
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital
- Variable neighborhood search: Principles and applications
- A memetic approach to the nurse rostering problem
This page was built for publication: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
