The Truck Scheduling Problem at Crossdocking Terminals - Exclusive versus Mixed Mode

L Berghman (1) , Cyril Briand (2) , R Leus (3) , Pierre Lopez (2)

1 Toulouse Business School
2 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
3 Department of Computer Science - K.U.Leuven

In this paper we study the scheduling of the docking operations of trucks at a warehouse; each truck is either empty and needs to be loaded, or full and has to be unloaded (but not both). We focus on crossdocking, which is a recent warehouse concept that favors the transfers of as many incoming products as possible directly to outgoing trailers, without intermediate storage in the warehouse. We propose a time-indexed integer programming formulation for scheduling the loading and unloading of the trucks at the docks, and we distinguish between a so-called " mixed mode " , in which some or all of the docks can be used both for loading as well as unloading, and an " exclusive mode " , in which each dock is dedicated to only one of the two types of operations. Computational experiments are provided to compare the efficiency of the two modes.

Mots clés: crossdocking; truck scheduling; parallel machine scheduling; integer programming

Domaines: Recherche opérationnelle [math.OC]

L Berghman, Cyril Briand, R Leus, Pierre Lopez. The Truck Scheduling Problem at Crossdocking Terminals - Exclusive versus Mixed Mode. 4th International Conference on Operations Research and Enterprise Systems (ICORES 2015), Jan 2015, Lisbonne, Portugal. pp.247-253, ⟨10.5220/0005205102470253⟩. ⟨hal-01230870⟩