Mostrar el registro sencillo del ítem

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

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorSADYKOV, Ruslan
dc.date.accessioned2024-04-04T02:33:10Z
dc.date.available2024-04-04T02:33:10Z
dc.date.issued2009
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190451
dc.description.abstractEnAt 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.
dc.language.isoen
dc.title.enA polynomial algorithm for a simple scheduling problem at cross docking terminals
dc.typeRapport
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.type.institutionInria
bordeaux.type.reportrr
hal.identifierinria-00412519
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00412519v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2009&rft.au=SADYKOV,%20Ruslan&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem