A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering

DOI10.1007/S10479-014-1540-7zbMath1336.90044OpenAlexW2127836968MaRDI QIDQ284416

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

zbMATH Keywords

linear programmingheuristicspersonnel rosteringself-rosteringshift rostering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Development of a new personalized staff-scheduling method with a work-life balance perspective: case of a hospital

Cites Work

• Bridging the gap between self schedules and feasible schedules in staff scheduling
• Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
• An evolutionary approach for the nurse rerostering problem
• 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
• Cyclic preference scheduling for nurses using branch and price

This page was built for publication: A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering