Reject Allowance Problem - 2 Problems
Reject Allowance Problem - 2 Problems
Scrap Estimates
◦ Determination of the quantity to be manufactured
for each component
For high volume production
The estimation of scrap
RejectAllowance Problem
◦ Determination the number of additional units to
allow when the number of items to produce are
very few and rejects randomly occur
For low volume production
The cost of scrap is very high
Reject allowance problem
x: Number of good units
p(x): Probability of producing exactly x good units
Q: Quantity of production
C(Q, x): Cost of producing Q units, with x good units
R(Q, x): Revenue from producing Q units, with x good units
P(Q, x): Profit from producing Q units, with x good units P(Q, x) = R(Q, x) -C(Q, x)
E[P(Q)]: Expected profit when Q units are produced
Q
EP(Q)= P(Q, x) p(x)
x=0
Q
EP(Q)= R(Q, x) − C(Q, x)p(x)
x=0
Profit −15000 * Q x 4
P(Q, x) =
$120000 −15000 * Q 4 = x = Q
• Expected Profit:
Probabilities
For each Q, the probability associated with each x is
different!
−15000*Q x 4
P(Q,x) =
$120000 −15000*Q 4 = x = Q
Reject Allowance Problem - Problem 1
Calculation of expected profits for Q = 4,5,6,7 and 8
Q
EP(Q)= P(Q, x) p(x)
x=0
4 5 6 7 8
Reject Allowance Problem - Problem 1
Determination of Optimal Order Size
40000
35000
Expected Profit ($)
30000
25000
20000
15000
10000
5000
0
-5000 4 5 6 7 8
Q
Reject Allowance Problem - Problem 1
Probability of losing money (if Q=5)?
C(Q, x) = $1100*Q
(200 −1100)*Q x 20
P(Q, x) =
$2500* 20 + (Q − 20) * 200−1100*Q x = 20
19 Q
25000
Expected profit for Q
20000
15000
10000
5000
0
22 24 26 28 30
-5000 20
-10000