A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
DOI10.1007/S10479-014-1540-7zbMATH Open1336.90044OpenAlexW2127836968MaRDI QIDQ284416FDOQ284416
Authors: Egbert van der Veen, J. M. J. Schutten, S. T. Uijland, Johann L. Hurink 
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1540-7
Recommendations
- Bridging the gap between self schedules and feasible schedules in staff scheduling
- Staff scheduling and rostering: a review of applications, methods and models.
- Near-optimal MIP solutions for preference based self-scheduling
- Heuristics for flexible employee scheduling
- Shift rostering using decomposition: assign weekend shifts first
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- An annotated bibliography of personnel scheduling and rostering
- Personnel scheduling: a literature review
- Preference scheduling for nurses using column generation
- A genetic algorithm approach to a nurse rerostering problem
- The state of the art of nurse rostering
- Bridging the gap between self schedules and feasible schedules in staff scheduling
- Cyclic preference scheduling for nurses using branch and price
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- An evolutionary approach for the nurse rerostering problem
Cited In (3)
This page was built for publication: A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284416)
