Optimized Rostering of Workforce Subject to Cyclic Requirements

Abstract : SNCF is a large railway transportation company that operates 365 days a year and 24 hours a day. In order to schedule a certain category of workers at train stations and ticket selling points, rosters are designed to cover a cyclical demand. However, the highly combinatorial nature of the rostering problem makes it very difficult to solve it manually, and experts spend a huge amount of time to make them legally feasible and to improve a certain number of preference criteria. This paper presents a mixed-integer programming model to address the cyclical rostering problem using patterns corresponding to feasible blocks of seven days and assigning them to each week of the roster. Some valid inequalities are presented to improve the linear relaxation of the model and thereby enhance computational performance. Implementation results are presented, including comparisons with an alternative daily-variables model.
Type de document :
Article dans une revue
Informatica, Slovene Society Informatika, Ljubljana, 2012, 36 (3), pp.327-336
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00755327
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mercredi 21 novembre 2012 - 08:56:09
Dernière modification le : mercredi 29 novembre 2017 - 10:08:22

Identifiants

  • HAL Id : emse-00755327, version 1

Collections

Citation

François Ramond, David De Almeida, Stéphane Dauzère-Pérès, Hanif D. Sherali. Optimized Rostering of Workforce Subject to Cyclic Requirements. Informatica, Slovene Society Informatika, Ljubljana, 2012, 36 (3), pp.327-336. 〈emse-00755327〉

Partager

Métriques

Consultations de la notice

114