Veuillez utiliser cette adresse pour citer ce document : http://dspace1.univ-tlemcen.dz/handle/112/1821
Affichage complet
Élément Dublin CoreValeurLangue
dc.contributor.authorHachemi, Khalid-
dc.contributor.authorSari, Zaki-
dc.contributor.authorGhouali, Noureddine-
dc.date.accessioned2013-04-23T09:36:06Z-
dc.date.available2013-04-23T09:36:06Z-
dc.date.issued2012-12-
dc.identifier.urihttp://dspace.univ-tlemcen.dz/handle/112/1821-
dc.description.abstractThe sequencing of requests in an automated storage and retrieval system was the subject of many studies in literature. However, these studies assumed that the locations of items to be stored and retrieved are known and the sequencing problem consisted in determining a route of minimal travel time between these locations. In reality, for a retrieval request, an item can be in multiple locations of the rack and so there is a set of locations associated with this item and not only one predetermined location in the rack. In this paper, we deal with the sequencing problem where a required product can be in several rack locations and there is a set of empty locations. Consequently, the retrieval and storage locations are not known a priori. We sequence by the minimum travel time of a double cycle (DC). An optimization method working step-by-step is developed to determine for each DC and according to storage and retrieval requests, the location of the item to be stored and the location of the item to be retrieved allowing the minimum DC time. The storage requests are processed in FCFS and retrieval requests retrievals requests are gathered by block according to wave sequencing. (C) 2012 Elsevier Ltd. All rights reserved.en_US
dc.language.isoenen_US
dc.titleA step-by-step dual cycle sequencing method for unit-load automated storage and retrieval systemsen_US
dc.typeWorking Paperen_US
Collection(s) :Articles internationaux

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
sequencing.pdf140,32 kBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.