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.
Document type :
Reports
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00412519
Contributor : Ruslan Sadykov <>
Submitted on : Tuesday, October 6, 2009 - 12:03:38 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM
Long-term archiving on : Saturday, November 26, 2016 - 11:54:16 AM

File

RR-7054.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00412519, version 2

Citation

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

Share

Metrics

Record views

416

Files downloads

179