Local and global constraint consistency in personnel rostering

DOI10.1111/ITOR.12357zbMATH Open1371.90122OpenAlexW2519814174MaRDI QIDQ5364073FDOQ5364073

Authors: Pieter Smet, Fabio Salassa, Greet Vanden Berghe 

Publication date: 2 October 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12357

Recommendations

• Polynomially solvable personnel rostering problems
• The state of the art of nurse rostering
• Analysis of three mathematical models of the staff rostering problem
• Personnel scheduling: models and complexity
• Simulated annealing approach to nurse rostering benchmark and real-world instances

zbMATH Keywords

integer programmingpersonnel rosteringcase studyconstraint evaluation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (9)

• Workload coverage through nonsmooth optimization
• Modelling history in nurse rostering
• Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds
• Joint employee weekly timetabling and daily rostering: a decision-support tool for a logistics platform
• Polynomially solvable personnel rostering problems
• The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation
• Integer programming model extensions for a multi-stage nurse rostering problem
• A flexible mixed integer programming-based system for real-world nurse rostering
• The roster quality staffing problem -- a methodology for improving the roster quality by modifying the personnel structure

This page was built for publication: Local and global constraint consistency in personnel rostering

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