Network flow models for intraday personnel scheduling problems

DOI10.1007/S10479-012-1234-YMaRDI QIDQ475176zbMATH OpenOpenAlexFDO

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/

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)

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

Cites work

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

Cited in

(5)

• A classification scheme for integrated staff rostering and scheduling problems
• An equivalent network flow model for the nonuniform capacity-constrained clustering problem
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
• Personnel shift assignment: Existence conditions and network models
• 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)