Volume 43, Number 4, October-December 2009ROADEF 07
|Page(s)||375 - 386|
|Published online||08 October 2009|
France Telecom workforce scheduling problem: a challenge
Operations Research Center, MIT, 77 Massachusetts Avenue, Cambridge, MA 02139, USA; email@example.com
2 IBM Zurich Research Lab, Säumerstrasse 4, 8803 Rüschlikon, Switzerland; firstname.lastname@example.org
Accepted: 18 June 2009
In this paper, we describe the methodology used to tackle France Telecom workforce scheduling problem (the subject of the Roadef Challenge 2007) and we report the results obtained on the different data sets provided for the competition. Since the problem at hand appears to be NP-hard and due to the high dimensions of the instance sets, we use a two-step heuristical approach. We first devise a problem-tailored heuristic that provides good feasible solutions and then we use a meta-heuristic scheme to improve the current results. The tailored heuristic makes use of sophisticated integer programming models and the corresponding sub-problems are solved using CPLEX while the meta-heuristic framework is a randomized local search algorithm. The approach herein described allowed us to rank 5th in this challenge.
Mathematics Subject Classification: 90B35 / 90B50 / 90B70 / 90C59.
Key words: Workforce scheduling / schedule generation scheme / roadef challenge.
© EDP Sciences, ROADEF, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.