Polynomially solvable personnel rostering problems

DOI10.1016/J.EJOR.2015.08.025zbMATH Open1346.90474OpenAlexW1639820114MaRDI QIDQ320874FDOQ320874

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

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

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• 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
• The first international nurse rostering competition 2010
• Modelling and evaluation issues in nurse rostering
• Title not available (Why is that?)
• Bounded flexibility in days-on and days-off scheduling
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• Personnel scheduling: models and complexity
• 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.

Cited In (11)

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

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)