Abstract.
This paper studies the days off scheduling problem when the demand for staffing fluctuates from day to another and when the number of total workdays is fixed in advance for each employee. The scheduling problem is then to allocate rests to employees with different days off policies: (1) two or three consecutive days off for each employee per week and (2) at least three consecutive days off for each employee per month. For each one, we propose a polynomial time algorithm to construct a solution if it exists.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: April 2005 / Revised version: October 2005
AMS classification:
60K25, 60K30
Rights and permissions
About this article
Cite this article
Costa, MC., Jarray, F. & Picouleau, C. An acyclic days-off scheduling problem. 4OR 4, 73–85 (2006). https://doi.org/10.1007/s10288-005-0086-6
Issue Date:
DOI: https://doi.org/10.1007/s10288-005-0086-6