A polynomial algorithm for a simple scheduling problem at cross docking terminals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

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

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.
Fichier principal
Vignette du fichier
RR-7054.pdf (196.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00412519 , version 1 (02-09-2009)
inria-00412519 , version 2 (06-10-2009)

Identifiers

  • HAL Id : inria-00412519 , version 2

Cite

Ruslan Sadykov. A polynomial algorithm for a simple scheduling problem at cross docking terminals. [Research Report] Inria. 2009. ⟨inria-00412519v2⟩
275 View
203 Download

Share

Gmail Facebook Twitter LinkedIn More