Upload
cardea
View
83
Download
0
Embed Size (px)
DESCRIPTION
The EOQ Model with Planned Backorders. Demand does not have to be satisfied immediately (from on-hand inventory). Customers are willing to wait. A penalty cost b is incurred per unit backordered per unit time. Orders are received L units of time after they are ordered. Objective. - PowerPoint PPT Presentation
Citation preview
1
The EOQ Model with Planned Backorders
2
Demand does not have to be satisfied immediately (from on-hand inventory).
Customers are willing to wait. A penalty cost b is incurred per unit backordered per unit
time. Orders are received L units of time after they are ordered
3
Minimize purchasing + ordering + holding + backordering cost
Objective
4
Notation
I: Average inventory level at timeB: Average number of backordersPB: Average fraction of time there is a stock-out (stock-out probability)B’: Average umber of units that are backordered
5
0
})(1{lim dttBT
B T
TtBB T)('lim'
0
})(1{lim dttPT
P BTB
6
Q/D 2Q/D 3Q/D 4Q/D
Q+ss
I(t)
t
ss
0
Lr
7
Let ss = r - DL, then
1. If ss > 0, I(t) > 0 and B(t) = 0,
2. If ss < - Q, I(t) = 0 and B(t) > 0
3. If -Q ss 0, then both I(t) and B(t) can be positive
Only case 3 makes sense!
8
T: time interval between orders T1: time interval within T during which we have positive inventory T2: Time interval within T during which backorders are positive
9
Q/D 2Q/D 3Q/D 4Q/D
Q+ss
I(t)
tss
0
10
T= Q/D T1= (Q + ss)/D T2= -ss/D
PB = T2/T = -ss/Q
I = (1-PB)(Q+ss)/2 = (Q+ss)2/2Q
B = PB(-ss/2) = ss2/2Q
11
Total Cost
Qssb
QssQhQADcDssQY
22)(/),(
22
0)(),(
Qbss
QssQh
ssssQY
02
)(),(2
2
2
22
2
Qbss
QssQh
QAD
QssQY
12
Total Cost
2 2 2
2 2 2
2 2 2 2 2
2 2 2
( , ) ( , ) ( )2
( (1 ) ) (1 ) 02
Y Q ss Y Q ss AD h Q ss bssQ Q Q Q QAD h Q Q b QQ Q Q
( ) 0h Q ss bss hQssQ Q h b
Let = b/(b+h), then
13
*
2*
* (1 )
* *
ADQh
ss Q
r DL ss
The Optimal Order Quantity
14
( *, *) 2
*( *, *) 1*B
Y Q ss ADh cD
ss hP Q sQ b h
The Optimal Cost and the Optimal Stockout Probability
15
Systems with Service Level Constraints
Minimize purchasing + ordering + holding cost, subject to a constraint on the probability of a stock-out.
16
Formulation
Minimize AD/Q + h(Q+ss)2/2Q + cD
Subject to: PB = -ss/Q 1- o
17
Since cost is increasing in ss while PB is decreasing in ss, the constraint is binding.
ss* = -Q(1- o
Y(Q, ss*) = AD/Q + ho2Q/2 + cD
22*ohADQ
18
Systems with Backorder Penalties per Occurrence
Instead of a cost b per backorder per unit time, we incur a one time cost k per backorder.
19
B’ = DPB = -Dss/Q
Y(Q,ss) = cD + AD/Q + h(Q+ss)2/2Q -kDss/Q.
ss* = kD/h – Q
Y(Q,ss*) = (c+k)D + [2ADh – (kD)2]/2hQ
Total Cost
20
1. + (kD)2 2ADh ss* = 0 and 2. + (kD)2 < 2ADh Q* = and ss* = -
Two Cases
* 2 /Q AD h
21
Systems with Lost Sales
No backorders are allowed Demand that arrives when no on-hand inventory is available is considered lost There is a penalty cost k’ (opportunity cost) for each unit of lost demand
22
ss’: amount of demand lost per order cycle Q’: amount of total demand per order cycle Q: amount of demand satisfied per order cycle = Q’-ss’
Average number of orders per unit time = D/Q’ Average inventory = (Q’-ss’)2/2Q’ PB = ss’/Q’ Average amount of demand lost per unit time = DPB= Dss’/Q’
23
Total costY(Q’,ss’) = cD(1-ss’/Q’) + AD/Q’ + h(Q’-ss’)2/2Q’ +k’Dss’/Q’.
= cD-cDss’/Q’ + AD/Q’ + h(Q’-ss’) 2/2Q’ +k’Dss’/Q’
= cD+ AD/Q’ + h(Q’-ss’) 2/2Q’ +(k’-c)Dss’/Q’
The total cost has the same form as in the case with costs per backorder occurrence a similar solution approach applies.