Solving the general employee scheduling problem

DOI10.1016/j.cor.2019.104794zbMath1458.90312OpenAlexW2970886168WikidataQ127303055 ScholiaQ127303055MaRDI QIDQ2333146

Lucas Kletzander, Nysret Musliu

Publication date: 11 November 2019

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

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

zbMATH Keywords

metaheuristicstask schedulingrostering

Mathematics Subject Classification ID

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

Related Items (2)

Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Cost of fairness in agent scheduling for contact centers

Uses Software

• SMAC

Cites Work

• Unnamed Item
• Workforce planning incorporating skills: state of the art
• A constraint-based approach for the shift design personnel task scheduling problem with equity
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Personnel scheduling: models and complexity
• Modelling and solving employee timetabling problems
• Staff scheduling and rostering: a review of applications, methods and models.
• Local search for shift design.
• Survey, categorization, and comparison of recent tour scheduling literature
• Personnel scheduling: a literature review
• The state of the art of nurse rostering
• New approaches to nurse rostering benchmark instances
• Interval scheduling: A survey
• Handbook of metaheuristics

This page was built for publication: Solving the general employee scheduling problem