On the complexity of nurse rostering problems

DOI10.1016/j.orl.2023.07.004MaRDI QIDQ6556163

Han Hoogeveen, Steven J. M. den Hartog, Tom C. van der Zanden

Publication date: 17 June 2024

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

complexityschedulingNP-completenessnurse scheduling

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Polynomially solvable personnel rostering problems
• The first international nurse rostering competition 2010
• Modelling and evaluation issues in nurse rostering
• Personnel scheduling: models and complexity
• An introduction to timetabling
• On the complexity of manpower shift scheduling
• A shift sequence based approach for nurse scheduling and a new benchmark dataset
• Personnel scheduling: a literature review
• The state of the art of nurse rostering
• On the Complexity of Timetable and Multicommodity Flow Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• Bounded flexibility in days-on and days-off scheduling

This page was built for publication: On the complexity of nurse rostering problems