Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost

Ruslan Sadykov 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : At cross docking terminals, products from incoming trucks are sorted according to their destinations and transferred to outgoing trucks using a small temporary storage. Such terminals allow companies to reduce storage and transportation costs in a supply chain. This paper focuses on the operational activities at cross docking terminals. We consider the trucks scheduling problem with the objective to minimise the storage usage during the product transfer. We show that a simplification of this NP-hard problem in which the departure sequences of incoming and outgoing trucks are fixed is polynomially solvable and propose a dynamic programming algorithm for it. The results of numerical tests of the algorithm on randomly generated instances are also presented.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00539849
Contributor : Ruslan Sadykov <>
Submitted on : Thursday, November 25, 2010 - 12:20:27 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Links full text

Identifiers

Citation

Ruslan Sadykov. Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost. Annals of Operations Research, Springer Verlag, 2012, 201 (1), pp.423-440. ⟨10.1007/s10479-012-1232-0⟩. ⟨inria-00539849⟩

Share

Metrics

Record views

303