Scheduling Full-Time and Part-Time Staff to Meet Cyclic Requirements

DOI10.1057/JORS.1974.7zbMATH Open0274.90019OpenAlexW1989861571MaRDI QIDQ5183256FDOQ5183256

Authors: Kenneth R. Baker 

Publication date: 1974

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1974.7

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• Rotating schedules
• An efficient two-phase algorithm for cyclic days-off scheduling.
• Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction
• A resource type analysis of the integrated project scheduling and personnel staffing problem

This page was built for publication: Scheduling Full-Time and Part-Time Staff to Meet Cyclic Requirements

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