Polynomially solvable personnel rostering problems

DOI10.1016/J.EJOR.2015.08.025MaRDI QIDQ320874zbMATH OpenOpenAlexFDO

Authors Pieter Smet, Peter Brucker, 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

networksassignmentpersonnel rosteringpolynomial time algorithms

Mathematics Subject Classification ID

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

Recommendations

• Personnel scheduling: models and complexity
• A graph-based formulation for the shift rostering problem
• The personnel task scheduling problem
• Local and global constraint consistency in personnel rostering
• Personnel shift assignment: Existence conditions and network models

Cites work

• scientific article; zbMATH DE number 2080236 (Why is no real title available?)
• A shift sequence based approach for nurse scheduling and a new benchmark dataset
• An XML format for benchmarks in high school timetabling
• Assignment problems: a golden anniversary survey
• Bounded flexibility in days-on and days-off scheduling
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• Integer programming to schedule a hierarchical workforce with variable demands
• Modelling and evaluation issues in nurse rostering
• Network flows. Theory, algorithms, and applications.
• On the complexity of manpower shift scheduling
• Operational research for health policy: making better decisions. Proceedings of the 31st annual conference of the European working group on operational research applied to health services, Southampton, UK, 31 July -- 5 August 2005.
• Personnel scheduling: a literature review
• Personnel scheduling: models and complexity
• Preference scheduling for nurses using column generation
• Single-shift off-day scheduling of a hierarchical workforce with variable demands
• Staff scheduling and rostering: a review of applications, methods and models.
• The first international nurse rostering competition 2010

Cited in

(12)

• A graph-based formulation for the shift rostering problem
• The second international nurse rostering competition
• Simulated annealing approach to nurse rostering benchmark and real-world instances
• On the complexity of nurse rostering problems
• Local search neighbourhoods for dealing with a novel nurse rostering model
• Towards a reference model for timetabling and rostering
• Local and global constraint consistency in personnel rostering
• Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds
• A flexible mixed integer programming-based system for real-world nurse rostering
• Personnel scheduling: models and complexity
• A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
• Personnel shift assignment: Existence conditions and network models

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

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