A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP)
| Autor: | Eric Bourreau, Matthieu Gondran, Nikolay Tchernev, Philippe Lacomme, Thierry Garaix |
|---|---|
| Přispěvatelé: | Methods, Algorithms for Operations REsearch (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
Workforce scheduling Operations research Computer science Strategy and Management 0211 other engineering and technologies 02 engineering and technology Workforce management Management Science and Operations Research Dynamic programming Industrial and Manufacturing Engineering Constraint Programming 020901 industrial engineering & automation Constraint programming Temporal dependencies Column generation [INFO]Computer Science [cs] 021103 operations research ComputingMilieux_THECOMPUTINGPROFESSION Quality of service [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] Workforce Scheduling and Routing Problem (WSRP) 8. Economic growth Workforce Decomposition method (constraint satisfaction) |
| Zdroj: | International Journal of Production Research International Journal of Production Research, In press, pp.1-19. ⟨10.1080/00207543.2020.1856436⟩ International Journal of Production Research, Taylor & Francis, In press, pp.1-19. ⟨10.1080/00207543.2020.1856436⟩ |
| ISSN: | 0020-7543 1366-588X |
| DOI: | 10.1080/00207543.2020.1856436⟩ |
| Popis: | International audience; Recent studies prove that industry is confronted with workforce issues which are, the majority of the time, determining factors in its evolution over the long-term. The aims of workforce management are to balance numerous objectives including relations between jobs/workers (workers' skills), operational costs, customers' quality of service and workers' quality of service. In their workforce management, many manufacturers include the routing of workers between customers. Another challenging and important difficulty is the coordination between workers to perform a job or a service. This paper deals with the Generalised Workforce Scheduling and Routing Problem (GWSRP) where 9 temporal constraints ensuring visit dependencies are all together taken into account and where customers and workers' quality of service are taken into consideration. A Constraint-Programming based Decomposition Method (CPDM) is proposed, firstly based on a relaxation of coordination constraints, and secondly with a constraint programming approach taking coordination constraints into account. Numerical experiments are achieved on instances derived from WSRP benchmark instances with up to 177 customers and 59 vehicles. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|