3 Warehousing
3 Warehousing
3 Warehousing
Warehousing
Overview
Examples
Purposes and functions
Strategic decisions
Warehouse layout
Receiving and Shipment Zones: Sizing
Storage Zone: Capacity
Storage Zone: Sizing (Length, Width, Height)
Product Allocation Dedicated Space
Order batching
Order picking
Recent developments
Receiving
Holding
Receiving
Receiving
Receiving
Holding
Holding
Holding
Picking
Picking
Picking
Picking
Batch forming
Shipping
Packaging
Shipping
Strategic issues
Type of storage racks / type of pallet
Material handling
Warehouse lay-out
Storage racks
Material handling
Manual
Forklift trucks (Straddle truck, Reach truck,
Counterbalanced truck, Free-path narrow-aisle machine, Rising
cabs, Two-deep reach, Stacker cranes
Conveyors
Articulated CB truck
Reach truck
Conveyor
Warehouse layout
Order batching
Order picking
dt
nD
qT
Storage Capacity
Inventory of product j at time t
dedicated space
each product is stored in a specific area
assign storage location to products
random space: products can be stored anywhere
the products are randomly distributed over the
warehouse
product
1
2
3
4
5
6
7
total space:
batch size
safety stock
1000
200
2500
400
11600
1250
850
300
1750
500
4500
1000
2600
950
md max I j (t )
j 1
mr max I j (t )
t
j 1
space
dedicated
random
1200
700
2900
1650
12850
7050
1150
725
2250
1375
5500
3250
3550
2250
29400
17000
m
x , y
wx , w y
n x , n y , nz
Lx x wx n x
1
2
Ly y n y w y
Ly
2
x 12 wx nx 12 y n y wy
space requirement : nx n y nz m
wy
1
2
3
4
5
6
2 3
nx 6
4 5
wx
I/O
n y 12
wx
7
8
9
10
11
12
Lx
Ly
nx , n y
x 12 wx nx 12 y n y wy
nx n y nz m
such that
LR x 12 wx nx 12 y n y wy (nx n y nz m)
x 12 wx n y nz 0
1
2
y n x n z 0
x 12 wx
n y nz
y
2nx nz
x 12 wx
ny
nx
y
nx n y nz m
n*x , n*y
m y
n
*
x
2nz x 12 wx
n*y
2m x 12 wx
y nz
j M
assume j 1
(add dummy product)
c jk
pj
mj
tk
Integer program:
minimize:
c
j 1 k 1
jk
x jk
subject to
M
x
k 1
n
x
j 1
jk
mj
j 1,..., n
jk
nz
k 1,..., M
x jk {0,1,..., nz } j , k
nz 1
M M ' nz ), we assume
Binary program:
1 assign product j to grid k
0 do not assign
x jk
n
minimize:
c
j 1 k 1
jk
x jk
subject to
M
x
k 1
n
x
j 1
jk
mj
j 1,..., n
jk
k 1,..., M
x jk {0,1}
j , k
Rewriting objective:
minimize
n
c
j 1
k 1
jk
x jk
j 1
kS j
jk
j 1
pj
kS j
tk
pj
j 1 m j
kS j
Example (1)
product
# of grids
total loads moved
required (mj)
per day (pj)
Ratio pj/mj
10
100
10
150
30
160
20
Example (2)
tk
6
1.5
4.5
I/O
Example (3)
tk
5
4
3
5 8
4 7
3 6
products
8
7
6
I/O
3
3
2
3 1
3 1
2 3
1
1
1
2
2
3
2 1
3 1
3 1
1
1
I/O
3
4
5
3 6
4 7
5 8
6
7
8
x
x
Start
Travelling Salesman Problem (TSP):
How to determine the travelling times?
x
x
Start
Order Picking
So far, we have assumed a Picker-to-product
environment, but sometimes it is Product-to-picker
(Order-to-picker):
AS/RS
Carousel
Walk/ride and pick
system (W/RPS) (may
visit multiple aisles)
Product to picker:
Horizontal carousel
Horizontal carousel
Horizontal carousel
Picking place
Horizontal carousel
Picking place
Horizontal carousel
Where to place fast moving (frequently
demand) and slow moving items?
Picking place
Horizontal carousel
Where to place fast moving (frequently
demand) and slow moving items?
Small orders: fast movers close to the
picking place.
Large orders: slow movers close to the
picking place.
Picking place
Slow movers
x
x
x
x
x
x
x
x x
Fast movers
x
x
x
x
x x
Fast movers
Large orders:
Better to put
slow movers close
to the picking place.
x
x
Slow movers
x
x
x
Fast movers
Small orders:
Better to put
fast movers close
to the picking place.
Fast movers
Horizontal carousel:
Nearest neighbour heuristic
In practice, the nearest neighbour heuristic is often applied for carousels.
On average, that performs quite well.
Recent developments
pick-to-light, pick-to-belt
Crossdocking
In a crossdock, goods arriving
from the vendor already have a
customer assigned, so workers
need only move the shipment
from the inbound trailer to an
outbound trailer bound for the
appropriate destination.
Crossdocking essentially
eliminates the inventory-holding
function of a warehouse while
still allowing it to serve its
consolidation and shipping
functions.
Shipments typically spend less
than 24 hours at the facility,
sometimes less than an hour.
Merge-in-transit
Merge-in-transit is similar to cross-docking, but differs in the way orders
are fulfilled. With merge-in-transit, it is essential to identify all the
component/shipments of a single order in the merging terminal and to
ensure that all the components are delivered at once, delaying the
earliest shipments if necessary.
In a cross-docking situation the emphasis is more on process
efficiency, as the shipments incoming to a terminal are forwarded with
the next delivery to the customer, often regardless of the order they
belong to.
The operational efficiency achievable with merge-in-transit is not as
high as with cross-docking, but it can be economically performed with a
wide product offering and a large customer-base.