The length of the document below is: 11 page(s) long
The self-declared author(s) is/are:
Author: Hector J. Carlo and German E. Giraldo
The subject is as follows:
Subject: Original authors did not specify.
The original URL is: LINK
The access date was:
Access date: 2019-04-12 14:11:11.757855
Please be aware that this may be under copyright restrictions. Please send an email to admin@pharmacoengineering.com for any AI-generated issues.
Loading...
Reload document 
Open in new tab The content is as follows:
OPTIMIZING THE REARRANGEMENT PROCESS IN A DEDICATED WAREHOUSE
Hector J. Carlo German E. Giraldo Industrial Engineering Department, University of Puerto Rico Œ Mayagüez, Call Box 9000, Mayagüez, PR 00681
Abstract Determining the optimal storage assignment for products in a dedicated
warehouse has been addressed extens
ively in the F
acility Logistics literature. However, the process of
implementing a particular storage
assignment given the curre
nt location of products
has not received much
attention in the existing literature.
Typically, warehouses use downtime or
overtime to remove products from thei
r current location and move them to
the suggested location. This work presents the
Rearrange-While-Working (RWW) policy to optimize the pro
cess of rearrang
ing a dedicated warehouse. The RWW policy seeks to
relocate products in a warehouse
from the initial arrangement to the optimal arrangement while serving a
list of storages and retrievals. This
study considers three scenarios: (1)
when there is only one empty locatio
n in the warehouse and the material
handling equipment (MHE) is idle (
i.e. reshuffling policy); (2) when there
is only one empty location in the
warehouse under the RWW policy; (3)
when there are multiple empty locati
ons in the warehouse under the RWW
policy. In the first case, the MHE can
make any movement desired as it is
idle. In the other cases, the movements
correspond to a list of storages and
retrievals that need to be
served. In these cases it
is assumed that products
can only be moved when they are re
quested. After being used, they are
returned to the warehouse. Several heuristics are presented for each
scenario. The proposed he
uristics are shown to pe
rform satisfactorily in
terms of solution quality and computational time.
1. Introduction and Literature Review
An important operational decision in warehouses
is to determine the
best storage location
for each product in order to minimize the tota
l material handling effort (or cost). This
problem is known in the literature as the
storage location assignment problem (SLAP).
Please note all content on this page was automatically generated via our AI-based algorithm (BishopKingdom ID: 0GY3vfpuBAQ3Sb4e4WRg). Please let us know if you find any errors.