Solver independent rotating workforce scheduling

DOI10.1007/978-3-319-93031-2_31MaRDI QIDQ1626767zbMATH OpenOpenAlexFDO

Authors Nysret Musliu, Andreas Schutt, Peter J. Stuckey

Publication date 21 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93031-2_31

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Efficient generation of rotating workforce schedules
• scientific article; zbMATH DE number 1275845
• A general multi-shift scheduling system
• Rota: A research project on algorithms for workforce scheduling and shift design optimization
• Solving the general employee scheduling problem

Cited in

(9)

• Efficient generation of rotating workforce schedules
• Instance space analysis for a personnel scheduling problem
• Counting and enumerating feasible rotating schedules by means of Gröbner bases
• Constraint-based robust planning and scheduling of airport apron operations through simheuristics
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• A general multi-shift scheduling system
• A General Branch-and-Cut Framework for Rotating Workforce Scheduling
• Hyper-heuristics for personnel scheduling domains
• Explainability results for the rotating workforce scheduling problem

This page was built for publication: Solver independent rotating workforce scheduling

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