Lot Sizing - Comprehensive
Lot Sizing - Comprehensive
Lot Sizing - Comprehensive
Lot Sizing
• Reduce Costs (Inventory, Setup).
• Managing Capacity.
LOT SIZING TECHNIQUES
• Lot for Lot
• Bulk
• EOQ • Fixed Order Quantity
• POQ • Fixed Period Quantity
• Min-Max system
• Part Period Balancing (PPB)
• Least Unit Cost
• Silver Meal (Minimum Cost per Period)
• Wagner-Whitin algorithm
• Least Total Cost
• McLaren Order Moment (MOM)
• Groff’s algorithm
Similar but lack systematic
• Freeland & Colley method
economic calculations.
• Chung et al. Based on human judgment
• Discount order quantity
Lot for Lot
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 0 0 0 0 0 0 0 0
Net Requirement 0 30 40 0 10 40 30 0 30 55
Planned Order Receipt 30 40 10 40 30 30 55
Planned Order Release 30 40 10 40 30 30 55
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 43 3 3 66 26 69 69 39
Net Requirement 0 30 0 0 7 0 4 0 0 16
Planned Order Receipt 73 73 73 73
Planned Order Release 73 73 73 73
POQ Periodic Order Quantity
POQ = EOQ
d
Where d = D average demand or demand rate
Total Cost = Setups + holding
52
Setups = 3 costing $300
From previous example POQ = 73 = 2.7 ≈ 3
Holding = 280 x $1 = $280
27
TOTAL= $580
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 40 0 0 70 30 0 85 55
Net Requirement 0 30 0 0 10 0 0 0 0 0
Planned Order Receipt 70 80 85
Planned Order Release 70 80 85
PPB 𝑇
Economic Part Period = Setup = 100
Part Period Balancing
𝑆 = ℎ 𝑘 − 1 𝐷𝑘 Holding Cost
𝑘=1 Where
Setup = cost of 1 setup
Select part periods that are closest to the EPP value Holding Cost = Cost per unit per week
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 60 30 30 0
Net Requirement 0 30 0 0 0 40 0 0 0 55
Planned Order Receipt 80 100 55
Planned Order Release 80 100 55
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 40 0 0 70 30 0 0 55
Net Requirement 0 30 0 0 10 0 0 0 30 0
Planned Order Receipt 70 80 85
Planned Order Release 70 80 85
Silver Meal Algorithm (Minimum Cost per Period)
𝑆 + ℎ σ𝑇𝑘=1 𝑘 − 1 𝐷𝑘
Select that cost where Cost Per Period =
per unit cost is lowest
σ𝑇𝑘=1 𝑇𝑘
Periods Total Lot Costs ($) Cost per period =
Combined T Size
Part Periods ($)
Setup Holding Total Total cost / periods
2 1 30 0 100 0 100 100
2,3 2 70 40x1 100 40 140 70
2,3,4 3 70 40x1 + 0x2 100 40 140 46.66
2,3,4,5 4 80 40x1 + 0x2 + 10x3 100 70 170 42.5
2,3,4,5,6 5 120 40x1 + 0x2 + 10x3 + 40x4 100 230 330 66
Select 2-5. Cost per period starts exceeding beyond periods 2-5
6 1 40 0 100 0 100 100
6,7 2 70 30x1 100 30 130 65
6,7,8 3 70 30x1 + 0x2 100 30 130 43.33
6,7,8,9 4 100 30x1 + 0x2 + 30x3 100 120 220 55
Select 6-8. Cost per period starts exceeding beyond periods 6-8
9 1 30 0 100 0 100 100
9,10 2 85 55x1 100 55 155 77.5
Silver Meal Algorithm
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 30 0 0 55
Net Requirement 0 30 0 0 0 40 0 0 30 0
Planned Order Receipt 80 70 85
Planned Order Release 80 70 85
Wagner-Whitin Algorithm
• Total cost (Zce ) = S + ℎ σ𝑒𝑖=𝑐(𝑄𝑐𝑒 − 𝑄𝑐𝑖 ) for 1 ≤ c ≤ e ≤ N
• S = Setup Cost
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 30 0 0 55
Net Requirement 0 30 0 0 0 40 0 0 30 0
Planned Order Receipt 80 70 85
Planned Order Release 80 70 85
Least Total Cost
• Stop when cumulative carrying cost exceeds Setup Cost.
Setup cost = $100
Least Total Cost
Total Lot Costs ($)
Periods Combined Part Periods ($) Holding cost > setup
Size Setup Holding
2 30 0 100 0 No
2,3 70 40x1 100 40 No
2,3,4 70 40x1 + 0x2 100 40 No
2,3,4,5 80 40x1 + 0x2 + 10x3 100 70 No
2,3,4,5,6 120 40x1 + 0x2 +10x3 + 40x4 100 230 Yes
Select 2-5. Holding cost of $230, for periods 2-6 exceeds setup cost of 100
6 40 0 100 0 No
6,7 70 30x1 100 30 No
6,7,8 70 30x1 + 0x2 100 30 No
6,7,8,9 100 30x1 + 0x2 + 30x3 100 120 Yes
Select 6-8. Holding cost of $120, for periods 6-9 exceeds setup cost of 100
9 30 0 100 0 No
9,10 85 55x1 100 55 No
Least Total Cost
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 30 0 0 55
Net Requirement 0 30 0 0 0 40 0 0 30 0
Planned Order Receipt 80 70 85
Planned Order Release 80 70 85
McLaren Order Moment (MOM)
• Involves two tests,
• TEST 1: Stop before accumulated part periods exceeds OMT
• TEST 2: Conducted to ascertain if another period can be
added or not, If 2nd condition holds true add that period as
well
∗
1st test 𝑂𝑀𝑇 = 𝑑 σ𝑇𝑡=1
−1
𝑡 + TBO − 𝑇 ∗ 𝑇 ∗
2nd test ℎ 𝑘 𝐷𝑡 ≤ 𝑆
SOLUTION
OMT = Order Moment Target
OMT = d[t+(TBO-T*)T*] d = Average requirement per period
d = 1404 (yearly Demand)/52 = 27 TBO = EOQ/d = Time between periods
TBO = EOQ /d= 73/27 = 2.7 = POQ without rounding
T* = 2
T* = Largest integer less than or equal to TBO
OMT = 27[1+(2.74-2)2] = 67
McLaren Order Moment (MOM)
Periods Total Lot Costs ($) TEST 1
Combined Dt k Size
Part Periods ($)
Setup Holding Part period > OMT
2 30 1 30 0 100 0 No
2,3 40 2 70 40x1 100 40 No
2,3,4 0 3 70 40x1 + 0x2 100 40 No
2,3,4,5 10 4 80 40x1 + 0x2 + 10x3 100 70 Yes
1st Test: Part Period of 70, exceeds OMT of 67, so we may decide to batch 2-4.
2nd Test: if h(k)(Dt)<S 1 x 4 x 10= 40≤100? Yes Hence we will include period 5
6 40 1 40 0 100 0 No
6,7 30 2 70 30x1 100 30 No
6,7,8 0 3 70 30x1 + 0x2 100 30 No
6,7,8,9 30 4 100 30x1 + 0x2 + 30x3 100 120 Yes
1st Test: Part Period of 120 exceeds OMT of 67, so we may decide to batch 6-8
2nd Test: if h(k)(Dt)<S 1 x 4 x 30= 120≤100? No Hence we will exclude period 9
9 30 1 30 0 100 0 No
9,10 55 2 85 55 x 1 100 55 No
McLaren Order Moment (MOM)
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 30 0 0 55
Net Requirement 0 30 0 0 0 40 0 0 30 0
Planned Order Receipt 80 70 85
Planned Order Release 80 70 85
Groff’s Algorithm
• Similar to MOM, however it considers the addition of a
future demand in the lot
• Select the periods meeting the following condition only
2𝑆
𝑛 𝑛 − 1 𝐷𝑡 ≤
ℎ
2𝑆
=200
S= 100 , h=1 ℎ
Dt = demand of that period
n = number of the periods carried
Groff’s Algorithm
Periods
# of period Dt n (n-1) Dt ≤ 200?
Combined
2 0 30 0(0-1)30=0 Yes
2,3 1 40 1(1-1)40=0 Yes
2,3,4 2 0 2(2-1)0=0 Yes
2,3,4,5 3 10 3(3-1)10=60 Yes
2,3,4,5,6 4 40 4(4-1)40=480 No
Do not include period 6 demand in the lot.
6 0 40 0(0-1)40=0 Yes
6,7 1 30 1(1-1)30=0 Yes
6,7,8 2 0 2(2-1)0=0 Yes
6,7,8,9 3 30 3(3-1)30=180 Yes
6,7,8,9,10 4 55 4(4-1)55=660 No
Do not include period 10 in the lot.
10 0 55 0(0-1)55=0 Yes
End of the horizon. The lot in period 10 will be 555.
Groff’s Algorithm
Period 1 2 3 4 5 6 7 8 9 10
Gross requirement 35 30 40 0 10 40 30 0 30 55
Scheduled Receipt
On hand 35 35 0 50 10 10 0 60 30 30 0
Net Requirement 0 30 0 0 0 40 0 0 0 55
Planned Order Receipt 80 100 55
Planned Order Release 80 100 55
On hand 35 35 0 50 10 10 0 60 30 30 0
Net Requirement 0 30 0 0 0 40 0 0 0 55
Planned Order Receipt 80 100 55
Planned Order Release 80 100 55