IISE Transactions,
Journal Year:
2019,
Volume and Issue:
52(6), P. 665 - 687
Published: Aug. 29, 2019
Order
picking
has
often
been
considered
as
one
of
the
most
labor-
and
time-intensive
tasks
in
warehouse
operations.
Among
various
planning
problems
that
have
to
be
solved
manual
picker-to-parts
systems,
routing
order
picker
usually
accounts
for
highest
share
total
operating
cost.
To
minimize
cost
picking,
researchers
developed
procedures
guide
through
complete
given
customer
orders.
For
some
layouts
such
chevron
warehouse,
an
optimal
algorithm
not
yet
proposed.
This
article,
therefore,
contributes
filling
this
research
gap
by
developing
policy
warehouse.
The
proposed
article
is
based
on
concept
graph
theory
utilizes
a
dynamic
programming
procedure.
In
addition,
we
propose
simple
heuristics
computational
experiments,
average
tour
lengths
resulting
from
are
compared.
Moreover,
compare
performance
conventional
two-block
under
conditions
using
obtained
algorithms.
European Journal of Operational Research,
Journal Year:
2023,
Volume and Issue:
313(1), P. 1 - 24
Published: Feb. 20, 2023
Order
Batching
is
a
family
of
optimization
problems
related
to
the
process
picking
items
in
warehouse
as
part
supply
chain
management.
Problems
classified
into
this
category
are
those
whose
policy
consists
grouping
orders
received
batches,
prior
starting
process.
Once
batches
have
been
formed,
all
within
same
batch
picked
together
on
single
route.
In
survey
we
review
known
family,
focusing
manual
systems
and
rectangular-shaped
warehouses
with
only
parallel
cross
aisles,
which
most
common
configuration
literature.
First,
identify
decisions
strategic,
tactical,
operational
levels
that
influence
task.
Then,
characterize
belonging
objective
function
might
differ.
The
identified
taxonomy
proposed
paper,
designed
host
future
family.
We
also
outstanding
papers
by
strategies
algorithms
for
relevant
activities:
batching,
routing,
sequencing,
waiting,
assigning.
To
conclude,
outline
open
issues
paths
topic
under
study.
