New approaches to nurse rostering benchmark instances
From MaRDI portal
Publication:2514811
DOI10.1016/j.ejor.2014.01.039zbMath1304.90088OpenAlexW2084743556MaRDI QIDQ2514811
Tim Curtois, Edmund Kieran Burke
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.039
Related Items (26)
A-priori upper bounds for the set covering problem ⋮ A flexible mixed integer programming-based system for real-world nurse rostering ⋮ An assessment of a days off decomposition approach to personnel shift scheduling ⋮ Effective learning hyper-heuristics for the course timetabling problem ⋮ A hybrid integer and constraint programming approach to solve nurse rostering problems ⋮ A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ 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 ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ Matheuristics: survey and synthesis ⋮ Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach ⋮ A rotation-based branch-and-price approach for the nurse scheduling problem ⋮ Physician Staffing for Emergency Departments with Time-Varying Demand ⋮ The nurse rerostering problem: strategies for reconstructing disrupted schedules ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ The second international nurse rostering competition ⋮ Modeling and solving staff scheduling with partial weighted maxSAT ⋮ Integer programming model extensions for a multi-stage nurse rostering problem ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ An integer programming approach for the physician rostering problem ⋮ Dynamic job assignment: a column generation approach with an application to surgery allocation ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ A graph-based formulation for the shift rostering problem ⋮ Solving the general employee scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduler -- a system for staff planning
- A \texttt{cost-regular} based hybrid column generation approach
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A generalized linear programming model for nurse scheduling
- A subproblem-centric model and approach to the nurse scheduling problem
- Staff scheduling and rostering: a review of applications, methods and models.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A 0-1 goal programming model for nurse scheduling
- An annotated bibliography of personnel scheduling and rostering
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- Preference scheduling for nurses using column generation
- Formal languages for integer programming modeling of shift scheduling problems
- A genetic algorithm approach to a nurse rerostering problem
- The state of the art of nurse rostering
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: New approaches to nurse rostering benchmark instances
