Download PDFOpen PDF in browser
EN
The title and the abstract of this preprint are also available in English

Constraint Programming based Decomposition Method to the Generalised Workforce Scheduling and Routing Problem

EasyChair Preprint no. 2607

2 pagesDate: February 8, 2020

Abstract

Le Generalised Worforce Scheduling and Routing Problem (GWSRP) est un problème combinant l’ordonnancement de visites, l’affectation d’employés aux visites, la génération de tournées des employés et la de coordination des visites. Le GWSRP est une extension du Worforce Scheduling and Routing Problem (WSRP) introduit par [1] et [2] par la prise en considération de contraintes de coordination entre les visites.

Keyphrases: contraintes de coordination, Programmation par contraintes, qualité de service, Workforce Scheduling

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
@Booklet{EasyChair:2607,
  author = {Éric Bourreau and Thierry Garaix and Matthieu Gondran and Philippe Lacomme and Nikolay Tchernev},
  title = {Constraint Programming based Decomposition Method to the Generalised Workforce Scheduling and Routing Problem},
  howpublished = {EasyChair Preprint no. 2607},

  year = {EasyChair, 2020}}
Download PDFOpen PDF in browser