The nurse rerostering problem: strategies for reconstructing disrupted schedules
From MaRDI portal
(Redirected from Publication:1725622)
Recommendations
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- A Novel Approach for the Nurse Scheduling Problem
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- The nurse rostering problem: a critical appraisal of the problem structure
- Building better nurse scheduling algorithms
- Nurse scheduling with tabu search and strategic oscillation
- An evolutionary approach for the nurse rerostering problem
- Nurse rostering problems -- a bibliographic survey.
- A systematic two phase approach for the nurse rostering problem
Cites work
- A genetic algorithm approach to a nurse rerostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A novel approach for nurse rerostering based on a parallel algorithm
- A systematic two phase approach for the nurse rostering problem
- A two-phase adaptive variable neighborhood approach for nurse rostering
- An evolutionary approach for the nurse rerostering problem
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- New approaches to nurse rostering benchmark instances
- Personnel scheduling: a literature review
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- Staff scheduling and rostering: a review of applications, methods and models.
- The first international nurse rostering competition 2010
- The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation
- The state of the art of nurse rostering
- Variable neighborhood search
- Variable neighborhood search accelerated column generation for the nurse rostering problem
Cited in
(11)- An integer multicommodity flow model applied to the rerostering of nurse schedules
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
- A flexible mixed integer programming-based system for real-world nurse rostering
- A learning large neighborhood search for the staff rerostering problem
- Fair shift change penalization scheme for nurse rescheduling problems
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- A novel approach for nurse rerostering based on a parallel algorithm
- The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- Dynamic personnel rescheduling: insights and recovery strategies
- Data-driven robust flexible personnel scheduling
This page was built for publication: The nurse rerostering problem: strategies for reconstructing disrupted schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725622)
