Bridging the gap between self schedules and feasible schedules in staff scheduling
From MaRDI portal
Publication:475167
DOI10.1007/s10479-012-1060-2zbMath1301.90025OpenAlexW2067030513MaRDI QIDQ475167
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1060-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Repairing high school timetables with polymorphic ejection chains ⋮ A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering ⋮ Near-optimal MIP solutions for preference based self-scheduling ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ Shift rostering using decomposition: assign weekend shifts first
Cites Work
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Staff scheduling and rostering: a review of applications, methods and models.
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Nurse scheduling with tabu search and strategic oscillation
- Towards a reference model for timetabling and rostering
- An annotated bibliography of personnel scheduling and rostering
- Preference scheduling for nurses using column generation
- The state of the art of nurse rostering
- On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
- A column generation approach for an employee scheduling problem with multiple shifts and work locations
- A memetic approach to the nurse rostering problem
This page was built for publication: Bridging the gap between self schedules and feasible schedules in staff scheduling
