Network flow models for intraday personnel scheduling problems

DOI10.1007/s10479-012-1234-yzbMath1301.90029OpenAlexW2035164787MaRDI QIDQ475176

Peter Brucker, Rong Qu

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/28278/

zbMATH Keywords

network flowsassignment problempersonnel scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ A classification scheme for integrated staff rostering and scheduling problems

Cites Work

• Unnamed Item
• Personnel scheduling: models and complexity
• Staff scheduling and rostering: a review of applications, methods and models.
• Towards a reference model for timetabling and rostering
• An annotated bibliography of personnel scheduling and rostering
• The state of the art of nurse rostering
• The Operator-Scheduling Problem: A Network-Flow Approach

This page was built for publication: Network flow models for intraday personnel scheduling problems