Polynomially solvable personnel rostering problems

DOI10.1016/j.ejor.2015.08.025zbMath1346.90474OpenAlexW1639820114MaRDI QIDQ320874

Peter Brucker, Pieter Smet, Patrick de Causmaecker, Greet vanden Berghe

Publication date: 7 October 2016

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/504892

zbMATH Keywords

networksassignmentpolynomial time algorithmspersonnel rostering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70)

Related Items

A flexible mixed integer programming-based system for real-world nurse rostering ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ The second international nurse rostering competition ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ Local search neighbourhoods for dealing with a novel nurse rostering model ⋮ Towards a reference model for timetabling and rostering ⋮ Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds ⋮ A graph-based formulation for the shift rostering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The first international nurse rostering competition 2010
• Modelling and evaluation issues in nurse rostering
• Personnel scheduling: models and complexity
• Assignment problems: a golden anniversary survey
• Single-shift off-day scheduling of a hierarchical workforce with variable demands
• Staff scheduling and rostering: a review of applications, methods and models.
• An XML format for benchmarks in high school timetabling
• Integer programming to schedule a hierarchical workforce with variable demands
• 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
• Preference scheduling for nurses using column generation
• Bounded flexibility in days-on and days-off scheduling
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING

This page was built for publication: Polynomially solvable personnel rostering problems