The title and the abstract of this preprint are also available

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

EasyChair Preprint 2607

2 pages•Date: February 8, 2020

Éric Bourreau, Thierry Garaix, Matthieu Gondran, Philippe Lacomme and Nikolay Tchernev

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: Programmation par contraintes, Workforce Scheduling, contraintes de coordination, qualité de service

Links:

https://easychair.org/publications/preprint/t73W

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@booklet{EasyChair:2607,
  author    = {É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 2607},
  year      = {EasyChair, 2020}}

Download PDF Open PDF in browser