The truck scheduling problem at cross-docking terminals

Lotte Berghman (1) , Cyril Briand (2) , Roel Leus (1) , Pierre Lopez (2)

1 ORSTAT - Operations Research and Business Statistics
2 LAAS-MOGISA

We study the general case of crossdocking, in which each dock can be used both for loading and unloading (so-called mixed mode). We propose a time-indexed linear programming formulation and a branch-and- bound algorithm to solve the problem.

Domaines: Recherche opérationnelle [math.OC]

Lotte Berghman, Cyril Briand, Roel Leus, Pierre Lopez. The truck scheduling problem at cross-docking terminals. International Conference on Project Management and Scheduling (PMS 2012), Apr 2012, Louvain, Belgium. 4p. ⟨hal-00661318⟩