Bridging the gap between self schedules and feasible schedules in staff scheduling

DOI10.1007/S10479-012-1060-2MaRDI QIDQ475167zbMATHOpenAlexFDO

Authors Eyjólfur Ingi Ásgeirsson

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

zbMATH Keywords

heuristicslocal searchrosteringstaff scheduling

Mathematics Subject Classification ID

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

Recommendations

• A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
• Near-optimal MIP solutions for preference based self-scheduling
• Scheduler -- a system for staff planning
• Solving the general employee scheduling problem
• An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling

Cites work

• A column generation approach for an employee scheduling problem with multiple shifts and work locations
• A memetic approach to the nurse rostering problem
• An annotated bibliography of personnel scheduling and rostering
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
• Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
• Nurse scheduling with tabu search and strategic oscillation
• On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
• Preference scheduling for nurses using column generation
• Staff scheduling and rostering: a review of applications, methods and models.
• The state of the art of nurse rostering
• Towards a reference model for timetabling and rostering

Cited in

(5)

• Shift rostering using decomposition: assign weekend shifts first
• A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
• Near-optimal MIP solutions for preference based self-scheduling
• Repairing high school timetables with polymorphic ejection chains
• Integer programming for minimal perturbation problems in university course timetabling

This page was built for publication: Bridging the gap between self schedules and feasible schedules in staff scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475167)