The \textsc{Days On Days Off Scheduling Problem}

DOI10.1016/J.EJOR.2025.07.011MaRDI QIDQ6859484zbMATH OpenFDO

Authors Fabien Nießen, Paul Paschmanns

Publication date 12 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.07.011

zbMATH Keywords

complexity theoryOR in health servicespersonnel schedulingtimetabeling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Bounded flexibility in days-on and days-off scheduling
• Cyclic Scheduling via Integer Programs with Circular Ones
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2080236 (Why is no real title available?)
• Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
• Modelling and evaluation issues in nurse rostering
• On a routing problem
• On the complexity of manpower shift scheduling
• On the complexity of nurse rostering problems
• Parametric shortest path algorithms with an application to cyclic staffing
• Personnel scheduling: models and complexity
• Polynomially solvable personnel rostering problems
• Staff scheduling and rostering: a review of applications, methods and models.
• The nurse rostering problem: a critical appraisal of the problem structure
• The state of the art of nurse rostering

This page was built for publication: The \textsc{Days On Days Off Scheduling Problem}

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