Journal
JOURNAL OF SCHEDULING
Volume 15, Issue 1, Pages 23-38Publisher
SPRINGER
DOI: 10.1007/s10951-009-0155-3
Keywords
Rostering problem; Linear programming; Column generation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available