Personnel shift assignment: Existence conditions and network models

DOI10.1002/NET.3230240704zbMATH Open0811.90058OpenAlexW2140514941MaRDI QIDQ4313629FDOQ4313629

Authors: Yeroon van Den Berg, D. M. Panton 

Publication date: 19 December 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/personnel-shift-assignment-existence-conditions-and-network-models(d9ed5320-0c32-4453-9b8c-eb7522a353e5).html

Recommendations

• Network flow models for intraday personnel scheduling problems
• Polynomially solvable personnel rostering problems
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• Solving Large-Scale Tour Scheduling Problems
• Models and algorithms for a staff scheduling problem

zbMATH Keywords

personnel scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Cited In (5)

• Staffing problems with local network externalities
• Polynomially solvable personnel rostering problems
• A flexible shift system for a fully-continuous production division
• Network flow models for intraday personnel scheduling problems
• Near-optimal solution to an employee assignment problem with seniority

This page was built for publication: Personnel shift assignment: Existence conditions and network models

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