Discounts
Constant vs Variable
Known vs Random
Continuous vs Discrete
Excess Demand
Lead time
Instantaneous
Constant or Variable
(deterministic/stochastic)
Dependence of items
Continuous
Periodic
One
Many
Form of Product
Unlimited
Limited (Constrained)
Single Period
Finite Period
Infinite
Number of Items
One
Multi (>1)
Capacity / Resources
None
Uniform with time
Planning Horizon
Number of Echelons
None
All orders are backordered
Lost orders
Substitution
Perishability
Independent
Correlated
Indentured
Review Time
None
All Units or Incremental
Single Stage
Multi-Stage
Chris Caplice, MIT
Traditional Management
Purchasing
Production
Marketing
Materials
Management
Purchasing
Vendor
MRP
MRP
Production
MRP
MPS
Marketing
DRP
DRP
Customer
DRP
Inventory Deployment
Material Requirements Planning
Master Production Scheduling
Distribution Requirements Planning
MIT Center for Transportation & Logistics ESD.260
Demand is "Continuous
[usage occurs in every period]
Demand is "Uniform"
[average usage per period is stable over time]
Demand is "Random"
[usage in any given period is not known in advance]
400
400
Demand
On Hand Inventory
600
200
200
0
0
On Hand Inventory
600
400
200
Can we do better?
MIT Center for Transportation & Logistics ESD.260
Frame
Fork
Front fender
Rear Fender
Sprocket
Crank
Pedal
Chain guard
Front Wheel
Rim
Axle
Spoke
Tire
Tube
Saddle
Shaft
Seat
Cover
Rear Wheel
Rim
Axle
Spoke
Tire
Tube
Sprocket
Handlebars
Bar
Gooseneck
Grip
10
5
7
22
10
5
7
22
10
5
7
22
10
5
7
22
10
5
7
22
10
30
10
28
68
0
0
0
0
0
10
0
10
30
0
0
30
0
10
28
38
Important to synchronize
MIT Center for Transportation & Logistics ESD.260
11
Metal part is made in 400 item batches on first 2 days of the month
Handles are procured from Pole Co.
Assembly occurs during first week of each month
12
Other methods?
13
Push MRP
Pull JIT
Major Premises
Major Concepts
14
What
What
What
What
Information Requirements
MRP Process
Requirements Explosion
Use of Bill of Materials (BOM)
Net from Gross Requirements
Requirements Time Phasing
Planned Order Release
15
Bicycle
Wheel (2)
Spoke (86)
Sprocket (1)
Tire (1)
Crank (2)
Level 1
Level 2
Pedal (2)
16
Bill of Materials
Product
Sub-assembly
Component
Bicycle
Quantity
[1]
Wheel
Lead Time
2
Spoke
86
Tire
Sprocket
Crank
Pedal
Crank Asm
MRP
1.
2.
3.
4.
5.
6.
Weekly buckets
Approach:
Start with Level i demand (i=0)
Find Gross Requirements (GR) and On Hand (OH) for Level i
Find Net Requirements (NR) for Level i+1 (NR=GR-OH)
Establish Planned Order Release (POR) for Level i using Level i lead times
Set GR for Level i+1 based on POR for Level i
Set i = i+1 and go to Step 2
17
Gross
Requirement
ITEM
PERIOD:
Bicycle
Rqmt
8
25
On Hand
Due In
25
POR
On Hand
25
>>
Wheel
Net
Requirement
>>
>>
>>
>>
Rqmt
>>
>>
>>
50
On Hand
Due In
50
POR
50
>
Planned
Order Release
Spoke
Rqmt
4300
On Hand
Due In
4300
POR
MIT Center for Transportation & Logistics ESD.260
4300
18
Item
Period:
Bicycle
W heel
Level 0
POR
25
GR
OH
50
50
50
GR
OH
4300
NR
4300
4300
GR
50
OH
NR
50
50
25
NR
POR
Level 2
25
25
GR
OH
25
NR
25
POR
Crank
25
GR
50
OH
NR
50
POR
What is missing?
MIT Center for Transportation & Logistics ESD.260
Pedal
GR
OH
NR
POR
19
25
GR
OH
Sprocket
OH
NR
POR
Crank Asm
25
POR
Tire
GR
NR
POR
Spoke
Level 1
50
20
20
20
20
50
20
30
30
Ordering Plan
Two Issues
How do we handle capacity constraints?
How do we handle uncertainty?
20
Data:
Di = Demand per period, i = 1,,n
Co = Ordering Cost
Chp = Cost to Hold, $/unit/period
M = a very large number.
MILP Model
Objective Function:
Minimize total relevant costs
Subject To:
Beginning inventory for period 1 = 0
Beginning and ending inventories must match
Conservation of inventory within each period
Nonnegativity for Q, B, E
Binary for Z
MIT Center for Transportation & Logistics ESD.260
21
i =1
i =1
Objective Function
Min TC = CO Z i + CHP Ei
s.t.
B1 = 0
Bi Ei 1 = 0
Ei Bi Qi = Di
MZ i Qi 0
i = 2,3,...n
i = 1, 2,...n
i = 1, 2,...n
Bi 0
i = 1, 2,...n
Ei 0
i = 1, 2,...n
Qi 0
i = 1, 2,...n
Z i = {0,1}
Conservation of
Inventory Constraints
Ensures buys occur
only if Q>0
Non-Negativity &
Binary Constraints
i = 1, 2,...n
22
MRP: Example
MRP: Example
MRP: Example
MRP: Example
I Tighten blnalng
MRP: Example
I
Notes:
Solves the End Items and the Components models separateltc
What is the impact? insight?
who n 7
Handling Uncertainty
Safety Stock
Safety Times
28
Tp
Q
v
r
Cd
C (t - T
d
)P[t ]
t=T p+1
Cd
CSL =
C d + rvQ
*
29
Tp
Tp
TC[T p ] = rvQT pP[t ] rvQtP[t ] + C dtP[t ] C d T pP[t ]
t=T +1
t=0
t=0
t=T p+1
p
Tp
dTC[T p ]
= rvQ P[t ] ( 0 ) + ( 0 ) C d T pP[t ] = 0
t=T +1
dTp
p
t=0
Cd
CSL =
C d + rvQ
*
30
=
=
=
=
$5.00/unit
36% annual
.005 dollars/unit/day
$500 per day
Q
= 1000 units
t'
= 10 days
= 3 days
(t ~ normal)
CSL* =
k* =
Tp* =
31
Benefits of MRP
Lower Inventory Levels
Less Expediting
32
Shortcomings of MRP
MRP is a scheduling, not a stockage, algorithm
33
34
Questions?
Comments?
Suggestions?