An acyclic days-off scheduling problem - Archive ouverte HAL Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2006

An acyclic days-off scheduling problem

Abstract

This paper studies the days off allocation problem when the demand for staffing fluctuates from day to another and when the number of worked days 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.
No file

Dates and versions

hal-01124966 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01124966 , version 1

Cite

Marie-Christine Costa, Fethi Jarray, Christophe Picouleau. An acyclic days-off scheduling problem. 4OR: A Quarterly Journal of Operations Research, 2006, 4, pp.73-85. ⟨hal-01124966⟩

Collections

CNAM CEDRIC-CNAM
42 View
0 Download

Share

Gmail Facebook X LinkedIn More