SADYKOV, Ruslan

doi:10.1007/s10479-012-1232-0

Métadonnées

Licence d’utilisation du document

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

Langue

Article de revue

Ce document a été publié dans

Annals of Operations Research. 2012, vol. 201, n° 1, p. 423-440

Springer Verlag

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

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

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche