Network flow models for intraday personnel scheduling problems

DOI10.1007/S10479-012-1234-YzbMATH Open1301.90029OpenAlexW2035164787MaRDI QIDQ475176FDOQ475176

Authors: 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/

Recommendations

• Personnel shift assignment: Existence conditions and network models
• Alternative MIP formulations for an integrated shift scheduling and task assignment problem
• Models and algorithms for a staff scheduling problem
• Personnel planning with multi-tasking and structured qualifications
• The personnel task scheduling problem

zbMATH Keywords

assignment problemnetwork flowspersonnel scheduling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A classification scheme for integrated staff rostering and scheduling problems
• Personnel shift assignment: Existence conditions and network models
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
• Personnel planning with multi-tasking and structured qualifications

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

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