Near-optimal MIP solutions for preference based self-scheduling

DOI10.1007/S10479-014-1597-3MaRDI QIDQ284428zbMATH OpenOpenAlexFDO

Authors Eyjólfur Ingi Ásgeirsson, Guríur Lilla Sigurardóttir

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-1597-3

zbMATH Keywords

local searchmixed integer programmingrosteringstaff scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• Scheduling staff using mixed integer programming
• Scheduler -- a system for staff planning
• Models and algorithms for a staff scheduling problem
• scientific article; zbMATH DE number 1462943
• Staff scheduling and rostering: a review of applications, methods and models.

Cites work

• A column generation approach for an employee scheduling problem with multiple shifts and work locations
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• An annotated bibliography of personnel scheduling and rostering
• Bridging the gap between self schedules and feasible schedules in staff scheduling
• 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
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Modelling and solving employee timetabling problems
• Nurse scheduling with tabu search and strategic oscillation
• On Manpower Scheduling Algorithms
• On the complexity of manpower shift scheduling
• 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.
• Survey, categorization, and comparison of recent tour scheduling literature
• The state of the art of nurse rostering

Cited in

(4)

• Scheduling staff using mixed integer programming
• The stable tournament problem: matching sports schedules with preferences
• A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
• Bridging the gap between self schedules and feasible schedules in staff scheduling

This page was built for publication: Near-optimal MIP solutions for preference based self-scheduling

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