Explainability results for the rotating workforce scheduling problem

DOI10.1007/978-3-032-27242-3_20MaRDI QIDQ7356174zbMATH OpenFDO

Authors Esther Mugdan, Lucas Kletzander, Nysret Musliu

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_20

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Cites work

• A General Branch-and-Cut Framework for Rotating Workforce Scheduling
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Efficient generation of rotating workforce schedules
• Efficiently explaining CSPs with unsatisfiable subset optimization
• Enumerating infeasibility: finding multiple MUSes quickly
• Generalizing Core-Guided Max-SAT
• Human-centred feasibility restoration in practice
• Identifying Minimally Infeasible Subsystems of Inequalities
• Instance space analysis for a personnel scheduling problem
• Irreducibly inconsistent systems of linear inequalities
• Personnel scheduling: a literature review
• PySAT: a Python toolkit for prototyping with SAT oracles
• Solver independent rotating workforce scheduling
• Staff scheduling and rostering: a review of applications, methods and models.
• Theory and Applications of Satisfiability Testing
• Workforce planning incorporating skills: state of the art

This page was built for publication: Explainability results for the rotating workforce scheduling problem

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