A polynomial algorithm for a simple scheduling problem at cross docking terminals
SADYKOV, Ruslan
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
SADYKOV, Ruslan
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Idioma
en
Rapport
Este ítem está publicado en
2009
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Orígen
Importado de HalCentros de investigación