Near-optimal MIP solutions for preference based self-scheduling

DOI10.1007/S10479-014-1597-3zbMath1336.90033OpenAlexW1992124514MaRDI QIDQ284428

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

staff schedulinglocal searchmixed integer programmingrostering

Mathematics Subject Classification ID

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

Related Items (1)

The stable tournament problem: matching sports schedules with preferences

Cites Work

• Unnamed Item
• Bridging the gap between self schedules and feasible schedules in staff scheduling
• Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
• Modelling and solving employee timetabling problems
• 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
• An annotated bibliography of personnel scheduling and rostering
• Survey, categorization, and comparison of recent tour scheduling literature
• On the complexity of manpower shift scheduling
• 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 Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• On Manpower Scheduling Algorithms

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