Abstract
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a set of demand curves (specifying the demand in terms of employees for each activity for each time period) the problem consists of constructing a set of work shifts such that each activity is at all time covered by a sufficient number of employees. Work shifts can cover many activities and must meet work regulations such as breaks, meals and maximum working time constraints. Furthermore, it is often desired to optimize a global objective function such as minimizing labor costs or maximizing a quality of service measure. This paper presents variants of this problem which are modeled with the Dantzig formulation. This approach consists of first generating all feasible work shifts and then selecting the optimal set. We propose to address the shift generation problem with constraint satisfaction techniques based on expressive and efficient global constraints such as gcc and regular. The selection problem, which is modeled with an integer linear program, is solved by a standard MIP solver for smaller instances and addressed by column generation for larger ones. Since a column generation procedure needs to generate only shifts of negative reduced cost, the optimization constraint cost-regular is introduced and described. Preliminary experimental results are given on a typical ETP.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Benoist, T., Gaudin, E., Rottembourg, B.: Constraint programming contribution to Benders decomposition: a case study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 603–617. Springer, Heidelberg (2002)
Chabrier, A.: Maestro: A column and cut generation modeling and search framework. Technical report, ILOG SA (2002)
Fahle, T., Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Sellmann, M.: Constraint programming based column generation for crew assignment. Journal of Heuristics 8, 59–81 (2002)
Fahle, T., Sellmann, M.: Cost based filtering for the constrained knapsack problem. Annals of Operations Research 115, 73–93 (2002)
Junker, U., Karish, S.E., Kohl, N., Vaaben, N., Fahle, T., Sellmann, M.: A framework for constraint programming based column generation. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 261–275. Springer, Heidelberg (1999)
Pesant, G.: A filtering algorithm for the stretch constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183–195. Springer, Heidelberg (2001)
Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)
Régin, J.-C.: Generalized arc consistency for global cardinality constraints. In: Proc. of AAAI 1996, pp. 209–215. AAAI Press/The MIT Press (1996)
Régin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32–46. Springer, Heidelberg (1997)
Rousseau, L.-M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with constraint programming based column generation. Annals of Operations Research 130, 199–216 (2004)
Rousseau, L.-M.: Stabilization issues for constraint programming based column generation. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 402–408. Springer, Heidelberg (2004)
Sellmann, M., Zervoudakis, K., Stamatopoulos, P., Fahle, T.: Crew assignment via constraint programming: integrating column generation and heuristic tree search. Annals of Operations Research 115, 207–225 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demassey, S., Pesant, G., Rousseau, LM. (2005). Constraint Programming Based Column Generation for Employee Timetabling. In: Barták, R., Milano, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2005. Lecture Notes in Computer Science, vol 3524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493853_12
Download citation
DOI: https://doi.org/10.1007/11493853_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26152-0
Online ISBN: 978-3-540-32264-1
eBook Packages: Computer ScienceComputer Science (R0)