A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
From MaRDI portal
Publication:284416
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
Cites work
- A genetic algorithm approach to a nurse rerostering problem
- An annotated bibliography of personnel scheduling and rostering
- An evolutionary approach for the nurse rerostering problem
- Bridging the gap between self schedules and feasible schedules in staff scheduling
- Cyclic preference scheduling for nurses using branch and price
- Personnel scheduling: a literature review
- Preference scheduling for nurses using column generation
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- The state of the art of nurse rostering
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)