A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand

DOI10.1016/j.cor.2014.03.019zbMath1349.90314OpenAlexW2123403399MaRDI QIDQ342022

Zdeněk Hanzálek, Přemysl Šucha, Zdeněk Bäumelt

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.019

zbMATH Keywords

evolutionary algorithmemployee rosteringevaluation methodologyhigh diversity of shiftsmultistage approach

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Adaptive online scheduling of tasks with anytime property on heterogeneous resources

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid grouping genetic algorithm for the cell formation problem
• Comparison and hybridization of crossover operators for the nurse scheduling problem
• Nurse rostering problems -- a bibliographic survey.
• Staff scheduling and rostering: a review of applications, methods and models.
• Local search for shift design.
• Towards a reference model for timetabling and rostering
• A 0-1 goal programming model for nurse scheduling
• The state of the art of nurse rostering
• The minimum shift design problem
• An integer programming model for the weekly tour scheduling problem
• Optimal Shift Scheduling with Multiple Break Windows
• ILP Models for a Nurse Scheduling Problem