An acyclic days-off scheduling problem |
| |
Authors: | Marie-Christine Costa Fethi Jarray Christophe Picouleau |
| |
Institution: | (1) Laboratoire CEDRIC, 292 rue Saint-Martin, 75003 Paris, France |
| |
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.
Received: April 2005 / Revised version: October 2005
AMS classification:
60K25, 60K30 |
| |
Keywords: | Workforce scheduling discrete tomography maximum flow polynomial time algorithm acyclic scheduling |
本文献已被 SpringerLink 等数据库收录! |