A polynomial algorithm for a simple scheduling problem at cross docking terminals

Ruslan Sadykov 1, 2
2 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 there destinations and transferred to outgoing trucks using a temporary storage. Such terminals allow companies to reduce storage and transportation costs in 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 arrival sequences of incoming and outgoing trucks are fixed is polynomially solvable by proposing a dynamic programming algorithm for it.
Type de document :
Rapport
[Research Report] RR-7054, 2009
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00412519
Contributeur : Ruslan Sadykov <>
Soumis le : mardi 6 octobre 2009 - 12:03:38
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12
Document(s) archivé(s) le : samedi 26 novembre 2016 - 11:54:16

Fichier

RR-7054.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00412519, version 2

Collections

Citation

Ruslan Sadykov. A polynomial algorithm for a simple scheduling problem at cross docking terminals. [Research Report] RR-7054, 2009. 〈inria-00412519v2〉

Partager

Métriques

Consultations de la notice

333

Téléchargements de fichiers

158