A systematic two phase approach for the nurse rostering problem
From MaRDI portal
Publication:439701
DOI10.1016/J.EJOR.2011.12.042zbMath1244.90104OpenAlexW2065601237MaRDI QIDQ439701
George Goulas, Christos Valouxis, Panayiotis Alefragis, Christos Gogos, Efthymios Housos
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.042
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (19)
A flexible mixed integer programming-based system for real-world nurse rostering ⋮ An assessment of a days off decomposition approach to personnel shift scheduling ⋮ Integer programming techniques for the nurse rostering problem ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ A particle swarm optimization approach with refinement procedure for nurse rostering problem ⋮ A two-phase adaptive variable neighborhood approach for nurse rostering ⋮ A hybrid integer and constraint programming approach to solve nurse rostering problems ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ Integer programming for the generalized high school timetabling problem ⋮ Investigation of Data Regularization and Optimization of Timetables by Lithuanian High Schools Example ⋮ Modelling a nurse shift schedule with multiple preference ranks for shifts and days-off ⋮ The nurse rerostering problem: strategies for reconstructing disrupted schedules ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ Integer programming model extensions for a multi-stage nurse rostering problem ⋮ An integer programming approach for the physician rostering problem ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM
Cites Work
- The first international nurse rostering competition 2010
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- The nurse rostering problem: a critical appraisal of the problem structure
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- Handbook of transportation science.
- Nurse scheduling with tabu search and strategic oscillation
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An integrated optimization model for train crew management
- An annotated bibliography of personnel scheduling and rostering
- The state of the art of nurse rostering
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital
- A memetic approach to the nurse rostering problem
- Combined bus and driver scheduling
This page was built for publication: A systematic two phase approach for the nurse rostering problem
