Abstract
| Original language | Undefined |
|---|---|
| Place of Publication | Enschede |
| Publisher | Department of Applied Mathematics, University of Twente |
| Number of pages | 18 |
| State | Published - Apr 2013 |
Publication series
| Name | Memorandum |
|---|---|
| Publisher | University of Twente, Department of Applied Mathematics |
| No. | 2005 |
| ISSN (Print) | 1874-4850 |
| ISSN (Electronic) | 1874-4850 |
Fingerprint
Keywords
- IR-85558
- METIS-296453
- Personnel scheduling
- Decomposition
- Mathematical Programming
- EWI-23259
- Days off scheduling
Cite this
}
An assessment of a days off decomposition approach to personnel scheduling. / van Veldhoven, Sophie; Post, Gerhard F.; van der Veen, Egbert; Curtois, Tim.
Enschede : Department of Applied Mathematics, University of Twente, 2013. 18 p. (Memorandum; No. 2005).Research output: Professional › Report
TY - BOOK
T1 - An assessment of a days off decomposition approach to personnel scheduling
AU - van Veldhoven,Sophie
AU - Post,Gerhard F.
AU - van der Veen,Egbert
AU - Curtois,Tim
PY - 2013/4
Y1 - 2013/4
N2 - This paper studies a two-phase decomposition approach to solve the personnel scheduling problem. The first phase creates a days off schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days off schedule. This decomposition is motivated by the fact that personnel scheduling constraints are often divided in two categories: one specifies constraints on working days and days off, while the other specifies constraints on shift assignments. To assess the consequences of the decomposition approach, we apply it to public benchmark instances, and compare this to solving the personnel scheduling problem directly. In all steps we use mathematical programming. We also study the extension that includes night shifts in thefirst phase of the decomposition. We present a detailed results analysis, and analyze the effect of various instance parameters on the decompositions' results. In general, we observe that the decompositions significantly reduce the computation time, and that they produce good solutions for most instances.
AB - This paper studies a two-phase decomposition approach to solve the personnel scheduling problem. The first phase creates a days off schedule, indicating working days and days off for each employee. The second phase assigns shifts to the working days in the days off schedule. This decomposition is motivated by the fact that personnel scheduling constraints are often divided in two categories: one specifies constraints on working days and days off, while the other specifies constraints on shift assignments. To assess the consequences of the decomposition approach, we apply it to public benchmark instances, and compare this to solving the personnel scheduling problem directly. In all steps we use mathematical programming. We also study the extension that includes night shifts in thefirst phase of the decomposition. We present a detailed results analysis, and analyze the effect of various instance parameters on the decompositions' results. In general, we observe that the decompositions significantly reduce the computation time, and that they produce good solutions for most instances.
KW - IR-85558
KW - METIS-296453
KW - Personnel scheduling
KW - Decomposition
KW - Mathematical Programming
KW - EWI-23259
KW - Days off scheduling
M3 - Report
T3 - Memorandum
BT - An assessment of a days off decomposition approach to personnel scheduling
PB - Department of Applied Mathematics, University of Twente
ER -