Pitch Presentation

By Karthik B Siddhartha Penmetsa Sandeep Koyya

Key objectives of the project

Re-design the replenishment model of Raw Materials and Packing materials for optimization of the warehouse space in Mulund Plant.
1.Effective space utilization by changing warehouse model
Implementing floating location system Effective racking system

1.Replenishment model change

Variable demand reorder point !" #o of orders $ead time

Background Research for the project

&'( classification based on volume
) Raw materials
& ) *anitary napkins ' ) +owder ( ) 'and aid

) +ackaging
& ) +owder ' ) 'and aid ( ) *anitary napkins

Replenishment
) Raw materials
& ) *anitary napkins
) Redefining reorder point with variable demand ) Reducing !"

) +ackaging
( ) *anitary napkins , redefining reorder point with variable demand
) Redefining reorder point with variable demand ) Reducing !"

Background Research for the project

Reorder point with variable demand. Reorder point R / d$ 0 z1sigma1s2rt3$4
d ) avg daily demand $ , lead time sigma ) std dev of daily demand z ) no of std deviations corr to service level probability

#on instantaneous receipt model. E!" / s2rt3351&*1p463ic3p,d444

& ) annual usage * , ordering cost i ) carrying cost rate p ) rate of production d ) rate of demand

Proposed course of action

(ube utilization and accessibility
(!I model

*tock location !rder picking and assembly

&dvantages of Random storage location 9oods stored wherever there is appropriate space Improved cube utilization :sually computer,based systems

+hysical (ontrol ; *ecurity ) Elements #ew replenishment model <imeline

Timeline
8

Cube per Order Index COI!

inimize = / >3?/1 to n4>3k/1 to 24 3<?6*?41fk1@?k 1. (ompute fk / >3i/1 to m4pi 1 dik 5. Renumber locations by f1 A/ f5 A/BB A/f2 %. Renumber *C:s by <16*1 D/ <56*5 D/BB.D/ <n6*n -. &ssign locations 1E 5E BE *1 to *C:1E locations *101E *105E BE *10*5 to *C:5E etc. <he (ube,per,order inde@ is computed and recorded separately for each *C:. &ll *C:s on the list are then ranked based on their (!IE *C: with the lowest inde@ being ranked first. #e@tE the minimal distances of the locations to the I6! point have to be determined. <he distances between the I6!,point and pick locations are measured taking into account the aisle structure of the picking area and these values are stored in a distance matri@ F. *C:s with the lowest (!I are given prime locations closest to the I6! point.

"eam Profi#e