Skip to Main content Skip to Navigation
Conference papers

On the complexity of the crossdock truck-scheduling problem

Quentin Fabry 1 Alessandro Agnetis 2 Lotte Berghman 3 Cyril Briand 1
1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
LAAS - Laboratoire d'analyse et d'architecture des systèmes
2 UNISI - Università degli Studi di Siena
3 TBS - Toulouse Business School
Keywords : crossdocking truck scheduling complexity
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-03010169
Contributor : Quentin Fabry <>
Submitted on : Tuesday, November 17, 2020 - 3:48:47 PM
Last modification on : Thursday, December 10, 2020 - 10:09:36 AM

File

Vignette du document
PMS_2020_Crossdocking___shortV...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03010169, version 1

Collections

UNIV-TLSE3 | UT1-CAPITOLE | UNIV-TLSE2 | INSA-TOULOUSE | LAAS-DECISION-ET-OPTIMISATION | LAAS-ROC | INSA-GROUPE | LAAS | CNRS

Citation

Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyril Briand. On the complexity of the crossdock truck-scheduling problem. 17th International Workshop on Project Management and Scheduling (PMS 2020-2021), Apr 2021, Toulouse, France. ⟨hal-03010169⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

26

Files downloads

27