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.036zbMATH Open1177.90356OpenAlexW2029745941MaRDI QIDQ1046124FDOQ1046124
Authors: Jingpeng Li, Rong Qu, Edmund K. 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
Recommendations
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- 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
Cites Work
- Title not available (Why is that?)
- Multicriteria optimization
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- 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.
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Preference scheduling for nurses using column generation
- The state of the art of nurse rostering
- Search Methodologies
- On Manpower Scheduling Algorithms
- An indirect genetic algorithm for a nurse-scheduling problem
- Title not available (Why is that?)
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A memetic approach to the nurse rostering problem
- Scheduling staff using mixed integer programming
- An estimation of distribution algorithm for nurse scheduling
- A simulated annealing approach to the cyclic staff-scheduling problem
- A distributed genetic algorithm for deterministic and stochastic labor scheduling problems
Cited In (35)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A constructive heuristic for staff scheduling in the Glass industry
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- An MIP model to schedule the call center workforce and organize the breaks
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- Integer programming techniques for the nurse rostering problem
- A systematic two phase 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 scenario-based robust optimization with a pessimistic approach for nurse rostering problem
- The nurse rostering problem: a critical appraisal of the problem structure
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- On a timetabling problem in the health care system
- A variable neighborhood search algorithm for the surgery tactical planning problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A constraint programming based column generation approach to nurse rostering problems
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- 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
- Integer programming model extensions for a multi-stage nurse rostering problem
- New approaches to nurse rostering benchmark instances
- 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
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem
- A variable neighborhood search based matheuristic for nurse rostering problems
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- A flexible mixed integer programming-based system for real-world nurse rostering
- Physician staffing for emergency departments with time-varying demand
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- Shift rostering using decomposition: assign weekend shifts first
- A Pareto-based search methodology for multi-objective nurse scheduling
Uses Software
This page was built for publication: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046124)
