The nurse rerostering problem: strategies for reconstructing disrupted schedules
From MaRDI portal
Publication:1725622
DOI10.1016/j.cor.2018.12.014zbMath1458.90372OpenAlexW2906365812WikidataQ128730526 ScholiaQ128730526MaRDI QIDQ1725622
Pieter Smet, Toni I. Wickert, Greet vanden Berghe
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.014
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)
Related Items (3)
A learning large neighborhood search for the staff rerostering problem ⋮ Fair shift change penalization scheme for nurse rescheduling problems ⋮ A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
Cites Work
- A novel approach for nurse rerostering based on a parallel algorithm
- A two-phase adaptive variable neighborhood approach for nurse rostering
- The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation
- A systematic two phase approach for the nurse rostering problem
- The first international nurse rostering competition 2010
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- An evolutionary approach for the nurse rerostering problem
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
- Variable neighborhood search
- Staff scheduling and rostering: a review of applications, methods and models.
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- Personnel scheduling: a literature review
- 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
- New approaches to nurse rostering benchmark instances
This page was built for publication: The nurse rerostering problem: strategies for reconstructing disrupted schedules