Article ID: | iaor2012925 |
Volume: | 15 |
Issue: | 1 |
Start Page Number: | 23 |
End Page Number: | 38 |
Publication Date: | Feb 2012 |
Journal: | Journal of Scheduling |
Authors: | Naudin , Chan P, Hiroux M, Zemmouri T, Weil G |
Keywords: | scheduling, programming: integer |
Staff rostering is a major challenge in the service sector, where exploitation costs are essentially made up of staffing costs. Searching for an optimum has direct economic returns but the rosters must satisfy numerous legal constraints. This paper presents work on an exact approach using branch‐and‐price methods on a concrete situation. We develop three MILP models and extend them with valid inequalities to two cases. Their computation results on a set of 960 tests covering several scenarios will then be compared and analyzed.