Mostrar el registro sencillo del ítem

dc.contributor.authorCarlo, Hector
dc.contributor.authorGiraldo González, Germán Eduardo
dc.date.accessioned2024-05-06T19:33:12Z
dc.date.available2024-05-06T19:33:12Z
dc.date.issued2012
dc.identifier.issn0360-8352spa
dc.identifier.urihttps://repositorio.escuelaing.edu.co/handle/001/3026
dc.description.abstractDetermining the optimal storage assignment for loads in a unit-load warehouse has been extensively addressed in the facility logistics literature. However, the process of implementing a particular storage assignment given the current assignment of loads has not received much attention. Typically, unit-load warehouses use downtime or overtime to remove loads from their current location and move them to the suggested location. This study presents Rearrange-While-Working (RWW) as a strategy to optimize the process of rearranging a warehouse while serving a list of move requests. This study examines three scenarios: (1) one empty location in the warehouse and the material handling equipment (MHE) is idle; (2) one empty location in the warehouse under the RWW strategy; and (3) when there are multiple empty locations in the warehouse under RWW. In the first scenario, the MHE can make any movement desired as it is idle. For the other two scenarios it is assumed that the MHE is not idle so loads can only be moved when requested to perform a move request. Due to the complexity of the problems, several heuristics are proposed. Experimental results indicate that the proposed heuristics perform satisfactorily in terms of solution quality and computational time.eng
dc.description.abstractLa determinación de la asignación óptima de almacenamiento para cargas en un almacén de carga unitaria se ha abordado ampliamente en la bibliografía sobre logística de instalaciones. en la literatura sobre logística de instalaciones. Sin embargo, no se ha prestado mucha atención al de almacenamiento dada la asignación actual de cargas no ha recibido mucha atención. Normalmente, los almacenes de carga unitaria utilizan el tiempo de inactividad o las horas extraordinarias para retirar las cargas de su ubicación actual y trasladarlas a la ubicación sugerida. Este estudio presenta Rearrange-While-Working (RWW) como una estrategia para optimizar el proceso de reorganización de un almacén mientras se atiende una lista de peticiones de traslado. Este estudio examina tres escenarios: (1) una ubicación vacía en el almacén y el equipo de manipulación de materiales (MHE) está inactivo; (2) una ubicación vacía en el almacén bajo la estrategia RWW; y (3) cuando hay múltiples ubicaciones vacías en el almacén bajo RWW. En el primer escenario, el MHE puede realizar cualquier movimiento que desee, ya que está inactivo. Para los otros dos escenarios se asume que el MHE no está ocioso por lo que las cargas sólo se pueden mover cuando se le pide que realice una solicitud de movimiento. Debido a la complejidad de los problemas, se proponen varias heurísticas. Los resultados experimentales indican que las heurísticas propuestas funcionan satisfactoriamente en términos de calidad de la solución y tiempo computacional.eng
dc.format.extent10 páginasspa
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.publisherElsevierspa
dc.rights.urihttps://creativecommons.org/licenses/by-nd/4.0/spa
dc.sourcehttps://www.sciencedirect.com/science/article/pii/S0360835212001611?via%3Dihubspa
dc.titleToward perpetually organized unit-load warehouseseng
dc.typeArtículo de revistaspa
dc.type.versioninfo:eu-repo/semantics/publishedVersionspa
oaire.accessrightshttp://purl.org/coar/access_right/c_14cbspa
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85spa
dc.contributor.researchgroupInvestigación, desarrollo y gerencia integral de proyectos - CEDGIPspa
dc.identifier.doihttps://doi.org/10.1016/j.cie.2012.06.012
dc.identifier.eissn1879-0550spa
dc.identifier.urlhttps://www.sciencedirect.com/science/article/pii/S0360835212001611?via%3Dihub
dc.publisher.placeEstados Unidosspa
dc.relation.citationendpage1012spa
dc.relation.citationissue4spa
dc.relation.citationstartpage1003spa
dc.relation.citationvolume63spa
dc.relation.indexedN/Aspa
dc.relation.ispartofjournalComputers & Industrial Engineeringeng
dc.relation.referencesArcher, A. F. (1999). A modern treatment of the 15 puzzle. American Mathematical Monthly, 106(9), 793–799.spa
dc.relation.referencesBaker, J. E. (1987) Reducing bias and inefficiency in the selection algorithm. In Proceedings of the second international conference on genetic algorithms and their application (pp. 14–21). Hillsdale, New Jersey: L. Erlbaum Associates.spa
dc.relation.referencesChristofides, N., & Colloff, I. (1973). The rearrangement of items in a warehouse. Operations Research, 21(2), 577–589.spa
dc.relation.referencesDrozdek, A. (2005). Data structures and algorithms in C++ (3rd ed.). Boston, MA: Course Technology.spa
dc.relation.referencesGiraldo, G. E. (2011) Metodología Para la Reorganización Perpetua de Almacenes. Master’s thesis. University of Puerto Rico – Mayaguez.spa
dc.relation.referencesGoetschalckx, M., & Ratliff, H. D. (1990). Shared storage policies based on the duration stay of unit loads. Management Science, 36(9), 1120–1132.spa
dc.relation.referencesGoldberg, D. (1989). Genetic algorithms in search, optimization, and machine learning (1st ed.). Boston, MA, USA: Addison-Wesley Longman Publishing Co. Inc.spa
dc.relation.referencesGu, J., Goetschalckx, M., & McGinnis, L. F. (2007). Research on warehouse operation: a comprehensive review. European Journal of Operational Research, 177(1), 1–21.spa
dc.relation.referencesGue, K. R., & Kim, B. S. (2007). Puzzle-based storage systems. Naval Research Logistics, 54(5), 556–567.spa
dc.relation.referencesHan, M. H., McGinnis, L. F., Shieh, J. S., & White, J. A. (1987). On sequencing in an automated storage/retrieval system. IIE Transactions, 19(1), 56–66.spa
dc.relation.referencesHausman, W. H., Schwarz, L. B., & Graves, S. C. (1976). Optimal storage assignment in automatic warehousing systems. Management Science, 22(6), 629–638.spa
dc.relation.referencesHeskett, J. L. (1963). Cube-per-order index: A key to warehouse stock location. Transportation and Distribution Management, 3, 27–31.spa
dc.relation.referencesJeroen, P., & Van den Berg, J. P. (1999). A literature survey on planning and control of warehousing systems. IIE Transactions, 31(8), 751–762.spa
dc.relation.referencesKim, K. H., & Bae, J. W. (1998). Re-marshaling export containers in port container terminals. Computers & Industrial Engineering, 35(3–4), 655–658.spa
dc.relation.referencesLee, H. F., & Schaefer, S. K. (1996). Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings. International Journal of Production Research, 34(10), 2943–2962.spa
dc.relation.referencesLinn, R. J., & Wysk, R. A. (1990a). An expert system framework for automated storage and retrieval system control. Computers & Industrial Engineering, 18(1), 37–48.spa
dc.relation.referencesLinn, R. J., & Wysk, R. A. (1990b). An expert system based controller for an automated storage/retrieval system. International Journal of Production Research, 28(4), 735–756.spa
dc.relation.referencesMuralidharan, B., Linn, R. J., & Pandit, R. (1995). Shuffling heuristics for the storage location assignment in an AS/RS. International Journal of Production Research, 33(6), 1661–1672.spa
dc.relation.referencesReinefeld, A. (1993). Complete solution of the eight-puzzle and the benefit of node ordering in IDA. Thirteenth International Joint Conference on Artificial Intelligence, 1, 248–253.spa
dc.relation.referencesRoodbergen, K. J., & Vis, I. F. A. (2009). A survey of literature on automated storage and retrieval systems. European Journal of Operational Research, 194, 343–362.spa
dc.relation.referencesTexas Instruments Incorporated (1995). System and method for defragmenting a file system. Inventor: James A. Capps. Filed: 5–22-1995. Int. CL. G06F 12/08. United States Patent. US6397311B1, 5–28-2002.spa
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccessspa
dc.rights.creativecommonsAtribución-SinDerivadas 4.0 Internacional (CC BY-ND 4.0)spa
dc.subject.proposalWarehouseeng
dc.subject.proposalStorage location assignmenteng
dc.subject.proposalOptimizationeng
dc.subject.proposalFacilities planning and designeng
dc.subject.proposalFacility logisticseng
dc.type.coarhttp://purl.org/coar/resource_type/c_2df8fbb1spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/articlespa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTspa


Ficheros en el ítem

Thumbnail

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

Mostrar el registro sencillo del ítem

https://creativecommons.org/licenses/by-nd/4.0/
Excepto si se señala otra cosa, la licencia del ítem se describe como https://creativecommons.org/licenses/by-nd/4.0/