Séance TB7 - Horaires de personnel / Shift Scheduling
Jour mardi, le 05 mai 2009 Salle Tal Gestion globale d'actifs inc. Président Guy Desaulniers
Présentations
|
13h30- 13h55 |
A Heuristic Branch and Price Approach for the Nurse Scheduling Problem |
|
Lakhdar Djeffal, Université Hadj Lakhdar BATNA, Mathématique, Faculté des Sciences Dpt Maths, Cité 106 lgts bloc2 N°4 Hadj Lakhdar, BATNA, ALGERIENNE, ALGERIE, 05000 Gilles Goncalves, Faculté des Sciences Appliquées, Laboratoire LGI2A, Technoparc - Futura, Béthune, France, 62400 This paper describes a method to solve the nurse scheduling problem. We use the dynamic Column Generation (CG) method combined with a Branch and Bound procedure. The search can be guided by a variable ordering heuristic selected by the CG that attempts to minimize the number of column generated. |
|
13h55- 14h20 |
Optimizing Daily Agent Scheduling in a Multiskill Call Center |
|
Wyean Chan, Université de Montréal, Informatique et recherche opérationnelle, C.P. 6128, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3J7 Athanassios N. Avramidis, University of Southampton, School of Mathematics, Highfield, Southampton, UNITED KINGDOM, SO17 1BJ Michel Gendreau, Université de Montréal, Informatique et recherche opérationnelle, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3J7 Pierre L'Écuyer, GERAD, Université de Montréal, Informatique et recherche opérationnelle/CIRRELT/GERAD, C.P. 6128, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3J7 Ornella Pisacane, University of Calabria We are interested in the agent scheduling problem in multiskill call centers. The objective is to minimize the total cost of agents under constraints on the expected service level per call type and period, and aggregated. We study an approach that uses integer or linear programming with simulation-based cutting-plane methods, combined with heuristic improvements. |
|
14h20- 14h45 |
Assigning Multiple Activities to Work Shifts |
|
Quentin Lequy, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 Mathieu Bouchard, Université Laval, FORAC, Pavillon Adrien-Pouliot, Québec, Québec, Canada, G1K 7P4 Guy Desaulniers, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 François Soumis, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 The multi-activity assignment problem consists of assigning activities to fixed work shifts so as to minimize activity undercoverage. We compare heuristic methods based on two integer programming models. We use a rolling horizon method and a specific branching method to tackle large-sized instances. Computational results will be presented. |
|
14h45- 15h10 |
A Column Generation Technique for the Shift Scheduling Problem with Flexible Breaks |
|
Batoul Mahvash, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada François Soumis, GERAD, École Polytechnique de Montréal, Mathématiques et génie industriel, C.P. 6079, Succ. Centre-ville, Montréal, Québec, Canada, H3C 3A7 A shift scheduling problem involves scheduling employees to meet demands that change over an operating day. For the special case of given shifts containing break windows, a column generation technique is used to produce accurate results for the large instances. In this case activity undercoverage must be minimized. |