DSpace Repository
1964
Williams, Robert L.
Monterey, California : Naval Postgraduate School
http://hdl.handle.net/10945/11927
o
t\
H DEMAND
rfANp DURING LEAD
inventory; controi
ME IN
TIME
SYSTEM
AN
ROBERT L WILLIAMS.
/
DUDLEY KNOX LIBRARY
NAVAL POSTGRADUATE SCHOOL
MONTFREY CA 93943-5101
Library
School
U. S. Naval Postgraduate
Monterey, California
This document has been approved for public
release and sale; its distribution is unlimited*
'1
DEMAND DURING LEAD TIME
a a a # % a
H*** *"
# "
DEMAND DURING LEAD TIME
by-
Robert Lo Williams
MASTER OF SCIENCE
IN
OPERATIONS RESEARCH
Monterey^ California
1 9 6 A
*
%
' ' '-iry'
by
Robert L Williams
MASTER OF SCIENCE
IN
OPERATIONS RESEARCH
from the
scribing demand and lead time and probability generating functions are
are discussed. The mean and variance of demand during lead time ar©
ii
TABLE OF CONTENTS
1. Introduction 1
7. Bibliography 35
Appendix
iii
LIST OF ILLUSTRATIONS
Figure Page
iv
TABLE OF SYMBOLS
5. R Reorder point
and to decide what should be the minimum stock level, of any item s
of this paper.
tion of the demand and the lead time of an item u The demand for an
item is the rate at which the stock of the item is depleted. The lead
time of an item is the length of the interval from the time a replenish
ment order is placed until the order is in stock, ready to satisfy the
customer's demand,
5
T
k:
ABC
Deterministic Inventory Model
ime
Figure 1
The stock is depleted at a uniform rate from a stock level of S
until it reaches the reorder point. When the stock level of R units
stock replenishment raises the stock level back to S units and the
process is repeated.
when the R units of stock on hand at the time of placing an order will
Id
tune
Figure 2
the shaded area A' R A" The variation in demand allows for the pos~
demands for stock in the period A' A. There is also the possibility
that the demand could be as low as R A" and in this case there would
demand and lead time, is shown in figure 3. The first two mode La
were special cases of this model and therefore model 3 will serve to
paper.
X U ZY
Figure 3
the same diagram except that the entire stock is increased by C unit.;
and the minimum lead time occur, the stock will be depleted along
line R A 1
until there are D units at time U when the replacement stock
is received. If the minimum demand and the maximum lead time occur
the stock will be depleted along line R A" until there are E units in
stock at time V when the order is received e Minimum demand and mini-
mum lead time will result in F units of stock on hand at time U when
with both variable demand and lead time. Only in the case of maximum
demand and minimum lead time would the stock be below C units „ The
last case is the combination of maximum demand and maximum lead time
The stock will be depleted along the maximum demand line R A" and will
be exhausted at time Z. The order will not be received until the maxi-
mum lead time, time V, therefore the system will be out of stock for a
line R A and time Y is the lead time> then the demand during lead
the actual demand and the actual lead times whatever they may be,,
will intersect above the zero stock level more often than below.
The reorder point, R, is then the sum of the expected demand daring
lead time plus a safety level or buffer stock of C units The re-
R = Z + V S L (1.1)
where
R = reorder point
ment periods , That is, the inventory manager may decide that a
cent of the time. The safety level is also a function of the reorder
quantity since the larger the reorder quantity for a given lead time
determined and does not affect the reorder point equation J6j 9 111
2. Discussion of the Problem
all cases, the method by which the problem is solved requires a model
inventory system being considered and the reorder point equation (Id)
lead time or at least the mean and variance of the distribution func-
lead time j, then the number of demands that occur during a lead time
Z = D + D 2 + 909 + D (2d)
1 L
where
L = lead time
tributed and demand and lead time are independent discrete random
which describes the demand during lead time by linking together the
mine the expected demand during lead tirne^ Z s and the variable
ly as
2 =
U Di (2 - 2)
it will be shown that the mean and variance can be computed for any
from the mean and variance of demand and lead time if that is all
that is known about them* It will also be shown that the distri-
8
can be used to set the reorder point using a variable safety level
Lets
p (1) be the mass function of lead time with mean L and vari-
ance U
E(Z) = E [e(zJL)]
= E [l E(D)
= E(D) E(L)
= D L
Z = D L
Var(Z) = E [_L 6^ J
+ Var |_L E(D)J
10
2
E(L) Op + [E (D)j <Jl
l aD2 + d
2
cr
L
2
The mean and variance of demand during lead time are functions
of the means and variances of the demand and lead time only, there-
mand and lead time data to estimate the means and variances of demand
and lead time The mean and variance of a distribution function may
11
4c Distribution of Demand During Lead Time
h(s) = E(s
Z
)
y k « r ,i
g(s) = E(s^)
D
f(s) = E(s )
and
JL It -
h(s) = E(s*) _
.Z\
E i(s*
= t? L = 1)
now
Z D Di Dl
E(s |L=l) =E(s ^
s oou s )
D| Pt D l:
= E( 8 )E(s )...E(s
12
since the Dj_ were assumed independent and identically distributed
Z 1
E(s |L= 1) = [f(s)]
and
Z L
E(s |L) = [f(s)J
Z ]
E [e(s |l)] ==E j[f(s)]
= g [f(s)]
since
L
g(s) = E(s )
,\ h(s) = g [f(s)]
Thus, if the distribution functions of demand and lead time are known
and this situation usually is not compatible with lead time. Prac-
tically, lead time can never be zero, if for no other reason than it
takes some time to prepare an order. On the other hand, if the data
13
in the inventory control system is based on the month as the basic
time unit s a lead time of one day could be considered zero. In any
event, if the mean of the lead time distribution is small, then "the
equals zero the sum is empty and Z is zero. Demand during lead time
can also be zero when demand is zero during the lead time or when
for lead time to be zero. In the first ease, when lead time can be
zero, the straight forward use of the model with distribution func-
tions of demand and lead time that are defined on the non-negative
integers will have provided the desired results a There are two methods
that may be used to prevent the consideration of zero lead time in the
H
writing it as:
-A oc-1
p(x; X) - - 4 , f or A > 0, x = 1,2,
(x-1)!
P [x = x|x > o] = e
A
x!(l-e~ )
1 A
A -1
e x!
x
A
p(x;M = , for A > 0, x = 1, 2,oo
A
(e -l) x!
There are then three choices offered for adjusting the input to fit
time so that they will be available for use in determining the prob-
Lead time distributions have not been as well documented 9 but the
time random variables and when the parameter r equals one, the nega<=
15
time distribution j the Poisson distribution will be used The use of
the Poisson distribution for lead time may not be a good example 9
6Q>
X k
f (s) = E(s ) = Zj s p[x = kl
k=0
a(s-1)
= e Ud)
when
X=1
p(x| A) =
e~*
~. — —
(x-1)!
-
X
Q- j,
x = 1, 2, o e a
N
A(s~*l)
,
f(s) = s e (^ 2;
when
X™- I
jj
<£ ^ ooo
16
n (w. „\ _= fr+x-1\ p r nq x
pU$r,p) I I ^X~Uft I y CO©
r
f (s) = f—
\1-q s /
U.3)
r +*-Z r
p(x;r,p) = ( ) p q*"
1
,1 = 1,2,.,,
f(s) =
• (— \1-qs
P \
/
F
(r+x-f
r x
V X ' v
p(x$r,p) = , x = 1, 2,
1-P
r
f (.) =
p Qjig£jl
r
i- P
then
=e Ms 1)
~
f(s)
and
h(s) = g [f (s)]
17
<a&
r
I
i_
k=1
e
A(s-1)k /r+k~2\
I k=li
k 1
= ^r
- p 8. A(i =1) z. -(s-1) (k-1) /V+k~2\ k-1
k=1 k-r
P
r e A(s-D 2k?i
(
\
r+ ML
k-V L
*(s~l)
/
k-1
r
e
A(e-1) 1-qe
p
were derived since they can be used to find the probability of de-
we haves
for any k.
18
in the previous examples, we can put them in a more useful form,
-
h(s) = e X(s 1) JL
__1-qe
M »1)J
OO
oo
oo co
= pr 2
k=0
fr+k-A q k .-A(fcfi)
\ k /
2
n=o
s" J^teafl!
n!
OP oo
= I
n=0
s
n
p rI k=0
(rfk-l\
k /
k
e
- A(k+1) j>l k +l2P
V n!
and
CO
rz=
L
n ]=P
J
r
2( rr)^«- A(k+i)lAiilI]1!
k=0 V K / n!
oo
- p e 4^2
n!k=o
(
\
r+
H
k ;
(qe
A
)
k
(k+O n
19
be summed until the remainder is negligible will be shown along with
00
r—
Zuuk Z>+k-l\ -a )k
AK = = ( (k+l) n
k=0 k=0\ k j
a - qe
and
CO CO
RlC " ^
7
Hf1
u lr = "K+1
" k "" %+1
7
^ —"K+1+1
Uf
then
U k+1+l n
K+1+1 - (Shi) a (k+2+D
U K+1 n
k+1
££) a (k+2)
n
(r+K+l)l(K+l)l /K±2±l\ 1
a
(K+1+1) !(r+K)! I K+2 /
n
(r+K+1) (r+K+1-1)... (K+l+r-(r-2) ) / K+2+l \ 1
(K+r) (K+r-1)... (K+r-(r-2) ) V K+2 1
n
= (r+k+1) (r+K+1-1)... (K+l+2) / K+l+2 \ 1
&
(K+r)(K+r-l) ... (K+2) V K+2 /
20
+ —1
K+r )/
(i
V
+ _U
K+r~1/
...
(
V
1+ -LV(1+
K+2/ \
-L\V
K+2/
(•4-) a1
then co
n+1
+ al
^^"k+i 1=6 (
1
t)
=>B = la a - - A + In q
and
l\ n+1 -Bl
¥(D (i+-jf)
«
then
<!>t)"
•-' [-
("t) ' f
Setting the derivative equal to zero, we have
1 = £±1-K
n+1
.
* „ the maximum for 1 occurs if K >—
B
hence we must use K such that it is at least this large
n+1
far K > B
21
iJO CO
&6 V K / fci V K /
n+1
^1+1 (1 + — J e
,
dx
•-5
e" *
I (T) ©' > dx
I
making a change of variables, let v=Bx, then dv=Bdx, and
z (.
. 4-r •• « •
• i
3=0
(-1 ©' * i .« e dv
n+1
B 1 +
I
3
ffl S
1
^
(n+1)! n+1
/ 1\
^ 1+ (1 + -IV
B V KB/
"k c "k+i L
1 +
a.-<-w [i +
^ (i^)
n+1
now if KB >n+1
22
e=B(K + D (K+2) n [l + <S±Hi .]
%<(£*)
error in P (Z-n) will then be less than that small number times
p e <^l= o
I f*"
1
)
k
a (k+ Dn = 1+Q a2 +
n
f+
1
)
a
2
3° + ... +
r+
(
1
^ )a
K
(K + l)
n
k=0
K
r(rH)...(r+K-l)
« 1. + » n
2 + £%tH
2
a
2
3
n
+ ...
I\!
& (K+l)
i
Let
r+K=1 / K+1 Vn
\
A,
23
and
3 = 1 + A
Q
B s 1 + A B
1 1
B. = 1 + A. B, „
where
A, =
J
- ——
r+K-1-1
^'-
a
/K-j+1\
[
J
] and B ~ =
1
. 1
K-j \
V K-j
K-.1 )
then
n
,k r
P |z = n]=[l+* K _ 1
B _
K a
].- p i|.
nl
As another example
Example 2
Let
Then
and
\
A(s=1) , .
;) = s e from eq (4.. 2)
Then
X Cf ( s )- 1]
h(s) = f(s) g [f(s)] = f(i) e
2U
Let us again find the Maclaurin expansion
hw =
feMfef H -1
CO
A r (k+1) .^ a \-r(k-¥l)
p (1=qs)
(
£6 T?
CO CO
2,
^ A
P
r(kH) A /r(k+l)+n-l\
n=0 V n
/
a)
(q S)
n
~k7 j
V
2L s
n
e
-*
q
n V
^ /r(k+l)+n-l\ A
7: P
r (k+1)
n k!
n^O k=0 V '
and od
r
p z - n
1
J - e
->
q
n
p
r Y
Z..1
/r(k+D+n-l\
n j
(A P )
k=0 * k!
Let
K K
r k
(A P )
k-0 k=0 \ n /
and
CO 00
% " ,
Z,
*-> %
"k ^ " %
"K Z, "T
f—
1=0
ut
k=K+1 K
Then
k
l(k t j±n.lll
(r(k+l)-1j
l
I n!
,
a
k
where a = ^
25
and
U K-:
(r K+rl + n~1 ) ! (rK + r-1) !
i
U
K (p K + pl=1 ) ! (r K + p+n-1 )
4v + )
(i +
V p(K+1+1)-1 / V p(K+1+1)-2 I V r(K+lW
Jl
^ v p(k+i);
Thus
U r -il
K+1
* +
^5Jo)
a
]
fi
let
r
*- [(
1+
^r) tl
*=[(i+ ^n< 1
26
if
+ - -If)
1
and
v\ n &,(D
Then X < 1
Now
CO CD
y °k+i . y
K K 1=0 K K
1=0
= u =
K
i-r
e
-*--*
q p uK -y
I \ _ & (W)-HM] 1 p
rK
«V P f
determined
Then, given K
K
_]T Mk+D+n-l\ Upr )
k
"k=0\ n / k!
27
The "nesting" technique is helpful in computing the probabil-
_ ^"°^ ^r _n
«.
n = e p q
«
b.% , r >1
and
r r 2
(3r+n-l) (Ap
A = .(r+n-lll + _(2rtn-l)j,.(Ap )
+ ! )
+
R
(p~l)ln! (2r-l)!n! (3r-l)l n!
r
..A + (rK+n-1).. . (rK +n-r) (A p ) \\ tt
Thus, if
B + AP
j L r(K-j)-lJ L p(K-j)-2j L r(K-j)-p_|
and
Cr> = 1 . then
C = 1 + B C
'j+1
1 +
Vi
28
and
1 + B K-2 C K-2
Now that the distribution of demand during lead time and methods
matter to find the number of items of stock that are required as the
reorder point. The reorder point must be the number of units of stock
that will last until new replacement stocks arrive with the probabil-
Then
P |Z>Rj<a
[z>h]
2_.P|_Z=n|^1-a
n=0
29
5. Negative Binomial Distribution of Demand During Lead Time
mand during lead time could be found for any distribution functions
of demand and lead time in a familiar form, but this is not possible,
It can be done in some special cases. One known case is given below
distribution*
=at fo+^d
p(djat) *
* vaT V ,d = 0,1,2,...
function
~ut
f(t,u,k) m& l™.\k-1
/
, t>0
k
with mean —*-. and variance —k
u n*
JCO
^-at / iN z .__-ut /.. iN k-1
(at) ue (ut)
p(z$k,u,a) =
z! (k-1)
30
. f z+k-1 -(a+u)t
a z uk t e dt
!(k-l)! o
z k
a u ~1 x
p(z^k,u,a)
s
= 7 r
z +k
z+K ; T /
x z+k e~ dx
* ' * (a+u) z!(k-l)! ^o
z k
a u (k+e-1)!
Z+k
(a+u) z!(k-l)!
k+z~1
z
(-fry
\a+u/ \a+u/
the last step being valid if k it an integer , Thus the demand during
ak
mean = =—
and
ak
variance x- /
1 +-a\
U \ U/
31
6. Summary and Conclusions
when discrete random variables describe the demand and lead time e
of computer time required for the calculations has not been investi-
gated, but since the calculations are straight forward and the number
use.
The use of the generating function method requires data for the
demands during a lead time. This data is not usually collected and
32
This Investigation has been made primarily to consider a method
numbers of very low demand i terns The low demand items are also
have been found to fit low and medium demand items . The Poisson
less items per year. The negative binomial distribution has been
used for items with demands ranging from two to one hundred per
order point can be readily applied. Since the reorder point will be
before the sum is equal to or greater than the service level desired
will be small , It has not been discussed in this paper, but when
generating function for demand during lead time can be used to find
and with several trials on either side of the old reorder point,
the tail of the distribution could be used to determine the new order
until the sum was greater than the desired probability. Feller [2]
33
gives the following relations between the probability generating
bution.
Then
1- h(s)
Q (s) =
1-s
The calculation of the tail in this paper has not been investigated
above, the tail of the distribution may be the easiest method for
lead times was discussed because this combination of demand and lead
good distribution for low demand items and the gamma distribution
any demand and lead time process that may possibly be fit to this
34
BIBLIOGRAPHY
35
APPENDIX I
E(X) = f'(l)
2
Var(X) = f"(l) + f'(l) - [f'(l)]
x-1
p(x|A) = e'
a _A 9
X — 1 9 7
(x-1)!
h(s) = |
h .(s) =
^(-^.p^^fy-l
T+1
+ ^ A(^f \2 r+1
-qs,
ex{A[[^|
36
and
h (l) =
!
—2- + -—
a-d + A)
2 2 2 2
h««(l) = -ij f[rq(l+A )] + r q ^ + rq (l+A)|
then
J"
"2 (1+A) +
P (?
37
;:
;'-;i •: